Delphi.science

OEIS A396804: a(n) mod 5 is never 3 (Hanna's conjecture)

Source: github.com/VictorLiwentao/fc-palomar-proofs/tree/f1418c529c…

Wentao Li

Palomar Registrypalomar/PALOMAR-2026-11-14-000011Nov 14, 2026math.COscore 0

For A(x) = Σ a(n) x^n/n! with A(x) = x exp(A∘A∘A∘A(x)), every a(n) (n >= 1) is an integer not congruent to 3 mod 5. Conjectured by Paul D. Hanna; an informal proof is in Vladimir Reshetnikov's ProveIt report (2026). The Lean proof is different.

RepositoryJSONText

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/palomar/PALOMAR-2026-11-14-000011
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-14-000011/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-14-000011/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'