login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A157598
Half the number of length n integer sequences with sum zero and sum of squares 8712.
1
1, 3, 198, 27930, 3388365, 475265259, 48238917727, 3831384879156, 290324159283540, 21674347016566915, 1571698374562433667, 110138942653526323056, 7411777323163714916688, 477289870722013730288040
OFFSET
2,2
LINKS
FORMULA
[cache enabling] count(n,s,ss)->count(n,t,tt) where t=s mod n, q=(t-s)/n, tt=ss+2*q*s+n*q^2; count(n,t,tt)=sum[i^2<=tt]{ count(n-1,t-i,tt-i^2) }. a(n)=count(n,0,8712)/2.
CROSSREFS
Sequence in context: A256407 A256406 A157565 * A023310 A054701 A356178
KEYWORD
nonn
AUTHOR
R. H. Hardin Mar 02 2009
STATUS
approved