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

A157591
Half the number of length n integer sequences with sum zero and sum of squares 6962.
1
1, 3, 354, 35410, 3079815, 254391501, 20017977868, 1645049437956, 130713839323245, 9274041450918255, 602446992143570574, 36862449524697504786, 2161188475320550751257, 122528449769743353508305
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,6962)/2.
CROSSREFS
Sequence in context: A209426 A037302 A341229 * A005336 A062226 A266454
KEYWORD
nonn
AUTHOR
R. H. Hardin Mar 02 2009
STATUS
approved