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

A157586
Half the number of length n integer sequences with sum zero and sum of squares 5832.
1
1, 3, 162, 16410, 1839645, 210928977, 17676193171, 1148671947972, 71262995700540, 4352863891098140, 258238261126722129, 14806140740844716211, 815211282605034375060, 42951699550186642926270, 2166061193994862365099390
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,5832)/2.
CROSSREFS
Sequence in context: A377253 A157440 A157559 * A341224 A042439 A364302
KEYWORD
nonn
AUTHOR
R. H. Hardin Mar 02 2009
STATUS
approved