hermite = {1: 1, 2: 4/3, 3: 2, 4: 4, 5: 8, 6: 64/3, 7: 64, 8: 256, 24: 4^24} # gamma_n^n
{n: N(g^(1/n), digits=30) for n, g in hermite.items()} # gamma_n
G = CartanMatrix(['E', 6]); n = 6
ZZ(IntegralLattice(G).minimum())^n / G.det() # 64/3 = gamma_6^6The datum for each entry is the rational number $\gamma_n^{\,n}$, a theorem in each dimension listed; $\gamma_n$ is written exactly where that rational is an $n$-th power ($n=1$, $8$, $24$) and otherwise as the ball for its $n$-th root in arb, computed with 64 guard bits beyond the 100 digits written; the widest ball relative to its value, $\gamma_7$, has radius $1.4\cdot 10^{-119}$.
Before a value is returned the generator recomputes $\gamma_n^{\,n}$ for $n\leq 8$ as $\mu^n/\det L$ from the Gram matrix of the attaining lattice, the identity matrix or the Cartan matrix, with $\mu$ from PARI's qfminim. Before any entry was written, $\gamma_n^{\,n}$ was compared with OEIS A007361/A007362 for $n\leq 8$; $\gamma_2$ to $\gamma_7$ with OEIS A020832 (ten times $\gamma_2$), A002580, A002193, A011093, A246184 and A246722 to every digit those entries give; the nine closed forms with those of the Wikipedia and MathWorld pages, evaluated in balls; $\gamma_n$ with the largest stored Hermite number in dimension $n$ of the table of the classical lattices, whose linked row holds the same hundred digits, and with $4\,\delta_n^{2/n}$ from the stored centre densities of the table of the densest known lattice packings; $\gamma_{24}^{\,24}$ with $\mu^{24}/\det$ of the Leech lattice's Gram matrix from the Catalogue of Lattices, with $\mu=4$ and $196560$ minimal vectors from qfminim; and Hermite's, Minkowski's, Blichfeldt's and Mordell's inequalities, with the stated equality cases, on every entry, Minkowski's against the stored digits of the table of unit-ball volumes as well. Controls that must fail did: $\gamma_4$ moved by $10^{-50}$ no longer matches A002193, and $\Lambda_{23}$ offered as the lattice attaining $\gamma_{24}$ is refused.