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

A157544
Half the number of length n integer sequences with sum zero and sum of squares 288.
1
1, 3, 18, 770, 20805, 522753, 9593507, 138576324, 1907158560, 25880343115, 341234146077, 4348150676532, 53202598238062, 622919366722485, 6980872709154870, 75312434538456228, 787522030868617855
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,288)/2.
CROSSREFS
Sequence in context: A070953 A163261 A064846 * A202946 A000853 A065402
KEYWORD
nonn
AUTHOR
R. H. Hardin Mar 02 2009
STATUS
approved