Delphi.science

OEIS A001006: Motzkin numbers at p − 2 modulo p (Batalov's conjecture; Burns, Kohen)

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

Wentao Li

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

For every prime p, p | M(p−2) iff p ≡ 1 (mod 3), and M(p−2) ≡ −1 (mod p) when p ≡ 5 (mod 6). Conjectured by Serge Batalov (2022) for p ≡ 1 (mod 6); proved by Rob Burns (2017) and Nadav Kohen (2024).

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