OFFSET
0,3
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) == p + 1 (mod p^2) holds for all primes p. (End)
LINKS
Vaclav Kotesovec, Table of n, a(n) for n = 0..1000
FORMULA
MAPLE
b:= proc(n) option remember; `if`(n=0, 1, add(b(n-j)*add(
`if`(d::odd, d, 0), d=numtheory[divisors](j)), j=1..n)/n)
end:
g:= proc(n, k) option remember; `if`(k=0, 1, `if`(k=1, b(n),
(q-> add(g(j, q)*g(n-j, k-q), j=0..n))(iquo(k, 2))))
end:
a:= n-> g(n$2):
seq(a(n), n=0..25); # Alois P. Heinz, Jan 31 2021
MATHEMATICA
Table[SeriesCoefficient[Product[(1+x^k)^n, {k, 1, n}], {x, 0, n}], {n, 0, 25}]
Table[SeriesCoefficient[QPochhammer[-1, x]^n, {x, 0, n}]/2^n, {n, 0, 25}]
Table[SeriesCoefficient[Exp[n*Sum[(-1)^j*x^j/(j*(x^j - 1)), {j, 1, n}]], {x, 0, n}], {n, 0, 25}] (* Vaclav Kotesovec, May 19 2018 *)
PROG
(PARI) {a(n)=polcoeff(prod(k=1, n, (1 + x^k +x*O(x^n))^n), n)}
for(n=0, 20, print1(a(n), ", ")) \\ Vaclav Kotesovec, Aug 26 2019
CROSSREFS
KEYWORD
nonn
AUTHOR
Vaclav Kotesovec, Mar 25 2016
STATUS
approved