Delphi.science

OEIS A000262 and A082579: Bala's Theorem 1 (periodicity modulo every k)

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

Wentao Li

Palomar Registrypalomar/PALOMAR-2026-11-14-000009Nov 14, 2026math.NTscore 0

If Σ a(n) x^n/n! = F(x) exp(x G(x)) with F, G integer power series and G(0) = 1, then a(n+k) ≡ a(n) (mod k) for all n, k (Bala 2017, Theorem 1). Hence A000262 (exp(x/(1−x))) and A082579 (exp(x/(1−x)^2)) satisfy k | a(n+k) − a(n) for k >= 2.

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