OEIS A326097: the parity of a(k) (Hanna's conjecture)
Source: github.com/VictorLiwentao/fc-palomar-proofs/tree/2329f9d4be…
The e.g.f. A(x) of OEIS A326097 satisfies 1 = Σ_{n≥0} ((1+x)^n − A(x))^n/n!. The package proves that this equation has exactly one solution in ℚ[[x]], that every a(k) = k! [x^k] A(x) is an integer, and that a(k) is odd if and only if k ∈ {0, 1, 3} or k ≡ 2 (mod 4). This settles Paul D. Hanna's 2019 parity conjecture in a slightly stronger form. The same holds for OEIS A385907, where (1+x)^n is replaced by 1/(1−x)^n.
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-11-16-000002
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-16-000002/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-16-000002/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'