OFFSET
0,3
COMMENTS
Let A(x) denote the g.f. and let m be an integer. Define a sequence by u(n) = [x^n] A(x)^(m*n). We conjecture that the supercongruence u(n*p^r) == u(n*p^(r-1)) (mod p^(3*r)) holds for all positive integers n and r and all primes p >= 7. Cf. A380581. - Peter Bala, Jan 21 2025
LINKS
Seiichi Manyama, Table of n, a(n) for n = 0..1000
FORMULA
G.f.: Product_{n>=1} (1 - x^n)^(n^4).
a(n) = -(1/n)*Sum_{k=1..n} sigma_5(k)*a(n-k).
CROSSREFS
KEYWORD
sign
AUTHOR
Seiichi Manyama, Mar 04 2017
STATUS
approved