{"schema":"vela.problem-packet.v0.1","problem":222,"statement":"Let $n_1<n_2<\\cdots$ be the sequence of integers which are the sum of two squares. Explore the behaviour of (i.e. find good upper and lower bounds for) the consecutive differences $n_{k+1}-n_k$.","status":"open","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[{"id":"A256435","name":"First differences of sums of two squares.","terms":"1,1,2,1,3,1,1,3,3,1,1,2,5,1,3,3,2,2,1,3,1,4,4,1,2,1,5,3,3,1,3,4,1,1,6,1,1,3,4,1,7,1,2,1,3,2,3,4,3,1,4,1,3,3,2,6,1,7,1,1,","url":"https://oeis.org/A256435"}],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}