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

A157569
Half the number of length n integer sequences with sum zero and sum of squares 2738.
1
1, 9, 234, 13330, 759255, 39386151, 1941592492, 100065421116, 4986199986795, 221853806154915, 9037873481632974, 346801773380423010, 12750860059402207015, 453349862010556020825, 15650738757439717731720
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,2738)/2.
CROSSREFS
Sequence in context: A276536 A288683 A302914 * A279492 A297747 A211052
KEYWORD
nonn
AUTHOR
R. H. Hardin Mar 02 2009
STATUS
approved