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

A157585
Half the number of length n integer sequences with sum zero and sum of squares 5618.
1
1, 3, 330, 27570, 2233965, 165759111, 11709395180, 864416336904, 61700500723635, 3932420281395045, 229474040212588578, 12613127103936869874, 664285970637825836755, 33831654295810674426165, 1673010760008675643666440
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,5618)/2.
CROSSREFS
Sequence in context: A235334 A160070 A112895 * A045645 A245190 A005335
KEYWORD
nonn
AUTHOR
R. H. Hardin Mar 02 2009
STATUS
approved