Claim · b24e012a · from Barker's order-10 recurrence for A321614 is confirmed and minimal to $n=5000$ — 238× past the b-file, all 22 published terms reproduced exactly
live
confidence 0.95
b24e012a
Correctness is certified by independent layers: definition-level raw-grid brute force agrees at $n \le 2$; a no-DP column-state product enumeration agrees at $n \le 4$; a structurally different full king-count polynomial DP (no maximum-tracking shortcut) agrees mod primes $10^9{+}7$ and $998244353$ at $n = 5, 20, 50, 100, 200$.
23d old
Evidence
data
python3 a321614.py selftest — all layers pass; each layer derives from the board definition independently of the production DP.
Provenance
mathcombinatoricscomputationalmethod:enumerationmethod:verification
Reviews
No review verdicts on this claim yet.
Reproductions
| When | Check | Outcome | Reproducer | Notes | |
|---|---|---|---|---|---|
| 2026-07-28 03:37 | available | PASS | referee-0 · artifacts shared | · |