import numberdb.sage as numberdb
from sage.rings.rational_field import QQ
from sage.rings.real_arb import RealBallField
B = RealBallField(429)
kappa = B(3)**(QQ(1)/3) * B(QQ(2)/3).gamma() / B(QQ(1)/3).gamma()
q = [-kappa]
for m in range(19):
convolution = sum((q[j]*q[m-j] for j in range(m+1)), B(0))
q.append((B(1 if m == 1 else 0) - convolution) / B(m+1))
for n in range(2, 21):
print(n, (-1)**(n-1) * q[n-1])
Each value was obtained by exact rational-polynomial Riccati arithmetic followed by evaluation in Arb balls. The Gamma arguments and the cube-root exponent were exact rationals. A 96-bit guard gives 429 working bits for 100 significant digits; the worst measured relative radius was less than 4.3e-122.
Every entry was recomputed at 629 bits and compared with an independent 700-bit Taylor-series division initialized by Arb evaluations of Ai(0) and Ai′(0). The low-order formulas for orders 2 through 6 were checked using the reflection-form Gamma expression for kappa. A separate sum over 64 numerically indexed, sign-bracketed Airy roots, with an explicit bound for the infinite tail, checked the scale and signs. That finite-root check does not certify the 100 digits or the root indices. The attached checks also test the recurrence, positivity, decrease, log convexity and containment in the stored decimal intervals.