{"schema":"vela.problem-packet.v0.1","problem":587,"statement":"What is the size of the largest $A\\subseteq \\{1,\\ldots,N\\}$ such that, for all $\\emptyset\\neq S\\subseteq A$, $\\sum_{n\\in S}n$ is not a square?","status":"solved","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[{"id":"A372040","name":"Smallest k such that there is an n-element subset of {1, 2, ..., k} that does not contain a (nonempty) subset that sums to a square.","terms":"2,3,5,8,12,18,22,34,40,62,76,85,134","url":"https://oeis.org/A372040"}],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}