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

A157545
Half the number of length n integer sequences with sum zero and sum of squares 338.
1
1, 9, 90, 1570, 32775, 596253, 10391500, 188323164, 3295910835, 51520770235, 737464758030, 9942564439314, 128439149539155, 1604475021960825, 19461485770566600, 229260099669952384, 2617537416673754961
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,338)/2.
CROSSREFS
Sequence in context: A294813 A218118 A160569 * A274953 A157558 A157584
KEYWORD
nonn
AUTHOR
R. H. Hardin Mar 02 2009
STATUS
approved