# Download generate.py and its listed attachments from this table.
from generate import ONanCoefficients
G = ONanCoefficients()
# The default enumeration is all nine classes and every admissible n <= 200.
print(G.value({'g': '1A', 'n': '3'}, 100)) # 26752CM traces are evaluated in 1024-bit Arb complex ball arithmetic using (1) and the class-number corrections in (2). The integrality theorem [1], Theorem 3.1(2), supplies the integer lattice. Every finite enclosure has both component radii below $10^{-110}$, contains zero in its imaginary component, and isolates exactly one integer in its real component. Each result is stored as that exact integer. Imprimitive forms and their exceptional stabilizers are included.
The 100 identity-class values agree with the independently computed Zagier trace table. The 162 class-grade comparisons through grade 36 agree with the multiplicities in [1], Appendix B, evaluated using [2]. Its character ordering agrees with DMO on the nine selected class columns except for a printed sign error: DMO Table A.1 gives $\chi_{22}(7A)=5$, whereas CTblLib gives $-5$. The value $-5$ is the rational value shared with the Galois conjugate $\chi_{21}$ and is congruent to the degree $169290$ modulo seven; the printed positive sign fails that necessary condition. The attached source controls preserve both readings. This correction concerns the independent check and does not alter the modular-form definition.
All 400 stated prime-power congruences and 200 equal-series comparisons are checked throughout the range. All 700 distinct level-grade coefficients agree at 1280 bits. Known modular values and deliberately wrong, nonfinite and broad enclosures test the checking procedure. The attached checker supports repeating the identities on values read from the draft.