Delphi.science

OEIS A371710: Hanna's mod-3 pattern

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

Wentao Li

Palomar Registrypalomar/PALOMAR-2026-11-16-000006Nov 16, 2026math.COscore 0

The e.g.f. A(x) = Σ a(n)xⁿ/n! of OEIS A371710 satisfies Σ_{n≥0} (A(x)^n − x)^n/n! = 1. The package proves that exactly one A ∈ ℚ[[x]] does, that A(0) = 0 and every a(n) is an integer, and Paul D. Hanna's 2024 conjecture that a(6n + k) ≡ [2, 0, 2, 1, 2, 2](k) (mod 3) for n > 0 and k = 0, …, 5. It also proves the stronger pattern a(m) ≡ 2 for even m ≥ 2 and a(m) ≡ 1 − m for odd m ≥ 3, modulo 3.

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