OFFSET
0,2
COMMENTS
From Peter Bala, Apr 18 2023: (Start)
The Gauss congruences a(n*p^k) == a(n*p^(k-1)) (mod p^k) hold for all primes p and all positive integers n and k.
Conjecture: the supercongruence a(p) == 2*p + 2 (mod p^2) holds for all primes p. Cf. A291697. (End)
LINKS
Seiichi Manyama, Table of n, a(n) for n = 0..1118 (terms 0..500 from Vaclav Kotesovec)
FORMULA
a(n) ~ c * d^n / sqrt(n), where d = 7.862983395705905261519347909953827161057584... and c = 0.299856802806668079413694689903953367699319...
a(n) = [x^n] 1/theta_4(x)^n, where theta_4() is the Jacobi theta function. - Ilya Gutkovskiy, Nov 03 2017
MATHEMATICA
Table[SeriesCoefficient[Product[((1+x^k)/(1-x^k))^n, {k, 1, n}], {x, 0, n}], {n, 0, 25}]
Table[SeriesCoefficient[(QPochhammer[-1, x]/QPochhammer[x, x])^n, {x, 0, n}]/2^n, {n, 0, 25}]
(* Calculation of constants {d, c}: *) eq = FindRoot[{2*s*QPochhammer[r*s] == QPochhammer[-1, r*s], (Log[1 - r*s] + QPolyGamma[0, 1, r*s])/Log[r*s] + r*((Derivative[0, 1][QPochhammer][-1, r*s] - 2*s*Derivative[0, 1][QPochhammer][r*s, r*s]) / (2*QPochhammer[r*s])) == 1}, {r, 1/8}, {s, 2}, WorkingPrecision -> 1000]; {N[1/r /. eq, 120], val = Sqrt[(1 - r*s)*Log[r*s]^2*(QPochhammer[r*s] / (Pi*(-r*s*(-1 + r*s) * Log[r*s]*(4*(2*ArcTanh[1 - 2*r*s] + QPolyGamma[0, 1, r*s])* Derivative[0, 1][QPochhammer][r*s, r*s] + r*Log[r*s]*(Derivative[0, 2][QPochhammer][-1, r*s] - 2*s*Derivative[0, 2][QPochhammer][r*s, r*s])) + 2*QPochhammer[r*s] * (4*r*s*ArcTanh[1 - 2*r*s] + 2*(-1 + (-1 + r*s)*ArcTanh[1 - 2*r*s])*Log[1 - r*s] - (-1 + r*s)*(-2 + Log[r*s] - 2*Log[1 - r*s])*QPolyGamma[0, 1, r*s] + (-1 + r*s) * QPolyGamma[0, 1, r*s]^2 + (-1 + r*s)*(QPolyGamma[1, 1, r*s] - 2*r*s*Log[r*s]* Derivative[0, 0, 1][QPolyGamma][0, 1, r*s])))))] /. eq; N[Chop[val], -Floor[Log[10, Abs[Im[val]]]] - 3]} (* Vaclav Kotesovec, Oct 03 2023 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Vaclav Kotesovec, Mar 25 2016
STATUS
approved