{"schema":"vela.problem-packet.v0.1","problem":748,"statement":"Let $f(n)$ count the number of sum-free $A\\subseteq \\{1,\\ldots,n\\}$, i.e. $A$ contains no solutions to $a=b+c$ with $a,b,c\\in A$. Is it true that\\[f(n)=2^{(1+o(1))\\frac{n}{2}}?\\]","status":"solved","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[{"id":"A007865","name":"Number of sum-free subsets of {1, ..., n}.","terms":"1,2,3,6,9,16,24,42,61,108,151,253,369,607,847,1400,1954,3139,4398,6976,9583,15456,20982,32816,45417,70109,94499,148234,2","url":"https://oeis.org/A007865"}],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}