{"schema":"vela.problem-packet.v0.1","problem":193,"statement":"Let $S\\subseteq \\mathbb{Z}^3$ be a finite set and let $A=\\{a_1,a_2,\\ldots,\\}\\subset \\mathbb{Z}^3$ be an infinite $S$-walk, so that $a_{i+1}-a_i\\in S$ for all $i$. Must $A$ contain three collinear points?","status":"open","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[{"id":"A231255","name":"a(n) is the smallest integer t such that every length-t walk from the origin (0,0) taking steps of either (0,1) or (1,0) is guaranteed to have n points that are collinear.","terms":"0,1,4,9,29,97","url":"https://oeis.org/A231255"}],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}