# With generate.py attached to this table:
# sage -pip install numberdb
from generate import determinant
n = 9
E_n = determinant(n, digits=100) # rigorous ball; n>=5
# Default table selection: list(range(5,17)).
# d_e(n) = n//4 - int(n%4 == 0).The defining moments use SageMath 10.9 complex Arb integration after $t=e^x$, at 525 working bits. The positive integral representations in [5] give the explicit origin and exponential tail bounds derived in the attached generator. Arb encloses each finite integration segment, both omitted endpoints, and the signed determinant [7]. The principal $K_0$ is evaluated through Tricomi $U$ [6]; the analytic callback rejects balls leaving the right half-plane of its argument. The weakest final enclosure retains 388 relative accuracy bits before serialization to 100 significant digits. Exact rational endpoint comparisons confirm containment of each complete computed ball in its stored last-place interval.
All 12 determinants were independently recomputed with mpmath at 130 decimal working digits, direct-$t$ tanh-sinh quadrature and a signed permutation expansion. Every result lies in its stored interval. This quadrature comparison is heuristic; the complete Arb enclosures support the stored precision. The five-factor Gamma evaluation and the odd/even reflection formula at every odd $5\leq n\leq15$ pass [2]. Both sides of these reflection checks were integrated independently of the sibling table. The nonzero controls $M(0,1;1)=1$ and $M(0,2;1)=1/2$ were also checked, at 50 working decimal digits. Wrong sign, missing pi, wrong dimension, divergent-boundary, NaN, infinite and vacuously wide interval controls are rejected.
The attached generator, exact binary-rational moment checkpoints, executable checks, result files, argument-selection note and matching archived skill manifest preserve the methods and evidence. Checkpoint replay with the same generator tests reproducibility separately from independent mathematical agreement.