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”).

A157602
Half the number of length n integer sequences with sum zero and sum of squares 9800.
1
1, 9, 378, 39990, 6207435, 649615491, 61839617931, 5291171373321, 436429418237100, 34318546032095787, 2635382197485052125, 197482663359487272702, 14177933118661639661880, 968391907322785974064260
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,9800)/2.
CROSSREFS
Sequence in context: A218714 A157567 A157593 * A124042 A297738 A225988
KEYWORD
nonn
AUTHOR
R. H. Hardin Mar 02 2009
STATUS
approved