Delphi.science

OEIS A364111: Bala's p^(3r) supercongruences

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

Wentao Li

Palomar Registrypalomar/PALOMAR-2026-11-16-000004Nov 16, 2026math.NTscore 0

For integers A ≥ 2 and B, C ≥ 1 let u(N) = Σ_{k=0}^{N} C(N+k−1, k)^A C(2N−2k, N−k)^B C(2k, k)^C. The package proves that u(np^r) ≡ u(np^{r−1}) (mod p^{3r}) for every prime p ≥ 5 and all n, r ≥ 1, as conjectured by Peter Bala (OEIS A364111, 2023), and the case (A, B, C) = (2, 1, 1), which is A364111 itself. The proof uses Coster's method, as Osburn and Sahu did for the generalized Domb numbers.

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