import numberdb.sage as numberdb
from sage.rings.integer_ring import ZZ
from sage.rings.real_arb import RealBallField
R = RealBallField(numberdb.bits(100, losing=64))
def growth_rate(n):
n = ZZ(n)
if n < 5:
raise ValueError('Use n >= 5')
return R(n-1) + R(n*(n-2)).sqrt()
[growth_rate(n) for n in range(5, 31)]The generator uses Arb real balls at 397 bits (100 decimal digits plus 64 guard bits) to evaluate the positive radical in (3). Every ball is finite and has relative radius smaller than $2^{-395}$; every stored 100-digit decimal interval contains its computed ball.
For all 26 entries, a separate checker constructs the face-adjacency graph, enumerates its finite special subgroups, and obtains (2) by Steinberg's formula [2], equation (2.5). Exact rational bisection of the reciprocal denominator supplies an independent root bracket inside each written decimal interval. Direct group-element enumeration through length three checks the first growth coefficients, with finite elementary abelian and free-product control groups. The quadratic, reciprocal trace, logarithm and exact fundamental-unit power identities are checked for every entry; stored regulators in the companion table provide additional comparisons where its discriminant range overlaps. The attached checks run both on generated values and on values read back from the database.