import numberdb.sage as numberdb
from sage.rings.rational_field import QQ
from sage.rings.real_arb import RealBallField
B = RealBallField(429)
t = B(QQ(1)/3).gamma() / (B(3)**(QQ(1)/3) * B(QQ(2)/3).gamma())
Z = {2: t, 3: QQ(1)}
for n in range(4, 21):
Z[n] = sum((Z[j]*Z[n-j] for j in range(2, n-1)), B(0)) / QQ(n-2)
for n in range(2, 21):
print(n, Z[n])
Each value was obtained by exact rational-polynomial arithmetic followed by evaluation in Arb balls. The Gamma arguments and cube-root exponent were exact rationals. A 96-bit guard gives 429 working bits for 100 significant digits; the lowest measured relative accuracy was 421 bits and the largest relative radius was less than 7.4e-128. Every value was recomputed at 628 bits.
An independent 600-bit computation extracted all 19 coefficients of Ai(z)/Ai′(z) from 512 direct Airy-function evaluations on the circle |z|=1/2, with an explicit alias bound of 2/(2^512-1). A polynomial with known nonzero coefficients was tested first as a control. The published low-order identities, the recurrence, positivity, strict decrease and strict log convexity were also checked. The exact identity Z_N(3)=1 is preserved as an integer. The attached checks verify containment of the independent enclosures in the stored decimal intervals and rerun the identities on values read back from the database.