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

A157596
Half the number of length n integer sequences with sum zero and sum of squares 8192.
1
1, 3, 6, 27310, 4493895, 469762041, 39763084319, 3062924462367, 231122336887800, 16732612596774745, 1176767971442596731, 80630592887297229153, 5290690279278336041746, 330378602282944731759075
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,8192)/2.
CROSSREFS
Sequence in context: A157564 A122182 A276701 * A111316 A297530 A222010
KEYWORD
nonn
AUTHOR
R. H. Hardin Mar 02 2009
STATUS
approved