\\ positive integer k only: the finite Euler-product formula is not valid for half-integers
default(realprecision, 140)
k = 3
a = prodeulerrat((1 - 1/p)^((k - 1)^2) * \
sum(j = 0, k - 1, binomial(k - 1, j)^2/p^j), 1, 2)
f = prod(j = 0, k - 1, factorial(j)/factorial(j + k))
a * fThe generator computes $a_k$ by the same Euler-product method as the arithmetic-factor table, multiplies by the Barnes $G$-function factor computed in arb ball arithmetic, and writes only digits that agree between 140-digit and 160-digit computations.
The checks include $c_1=1$, $c_2=1/(2\pi^2)$, the integer rows against PARI's prodeulerrat [4], and the computed $a_k$ values against the arithmetic-factor table.