OFFSET
0,2
COMMENTS
Conjecture: the supercongruence a(n*p^k) == a(n*p^(k-1)) (mod p^(2*k)) holds for all primes p >= 5 and positive integers n and k. - Peter Bala, Aug 29 2025
LINKS
Robert Israel, Table of n, a(n) for n = 0..698
MAPLE
f:= proc(n) local t; add(subs(x=1, t)^3, t = expand((1+x+x^2)^n)) end proc:
map(f, [$0..20]); # Robert Israel, Aug 29 2025
PROG
(PARI) a(n)=sum(k=0, 2*n, polcoeff((1+x+x^2)^n, k)^3)
CROSSREFS
KEYWORD
nonn
AUTHOR
Paul D. Hanna, Aug 18 2007
STATUS
approved
