{"schema":"vela.problem-packet.v0.1","problem":1141,"statement":"Are there infinitely many $n$ such that $n-k^2$ is prime for all $k$ with $(n,k)=1$ and $k^2<n$?","status":"solved","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[{"id":"A214583","name":"Numbers m such that for all k with gcd(m, k) = 1 and m > k^2, m - k^2 is prime.","terms":"3,4,6,8,12,14,18,20,24,30,32,38,42,48,54,60,62,68,72,80,84,90,98,108,110,132,138,140,150,180,182,198,252,318,360,398,468","url":"https://oeis.org/A214583"}],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}