# With generate.py attached to this table:
# sage -pip install numberdb
from generate import determinant
n = 7
O_n = determinant(n, digits=100) # rigorous ball; n=3 or n>=5
# Default table selection: [3] + list(range(5,17)).
# d_o(n) = (n+1)//4 - int(n%4 == 0).The defining moments use SageMath 10.9 complex Arb integration after $t=e^x$, at 525 working bits. Both omitted endpoints are bounded using the positive integral representations in [6]; the attached generator derives the origin and exponential tail estimates. Arb encloses every finite integration segment, propagates both tail bounds, and evaluates the signed determinant with ball arithmetic [8]. The principal $K_0$ is evaluated by its Tricomi-U representation [7], avoiding native Bessel-evaluation cancellation measured in this runtime. The callback rejects balls leaving the analytic right half-plane of $K_0$. The weakest final enclosure retains 376 relative accuracy bits before serialization to 100 significant digits. Exact rational endpoint comparisons confirm containment of the entire computed ball in each stored last-place interval.
All 13 determinants were independently recomputed with mpmath at 130 decimal working digits, direct-$t$ tanh-sinh quadrature and a signed permutation expansion of the determinant. Every result lies in its stored interval. This independent quadrature check is heuristic; the stored precision is supported by the complete Arb enclosures. The nonzero moment controls $M(0,1;1)=1$ and $M(0,2;1)=1/2$, the closed forms for $O_3$ and $O_5$, and the odd/even reflection formula in [2], equation (1.21), at $n=5,7,9$ pass. Wrong sign, missing pi, wrong reduced dimension, NaN and infinite controls are rejected.
The attached argument-selection note, generator, exact binary-rational moment checkpoints, executable checks, result files and matching archived skill manifest preserve the methods and evidence. Reproducibility against the same generator is checked separately from independent mathematical agreement.