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

A157557
Half the number of length n integer sequences with sum zero and sum of squares 1250.
1
1, 3, 222, 7810, 245715, 7887621, 271336828, 9598223664, 323149486005, 9653120522639, 265199107509930, 6875831133411318, 170878889034103705, 4105071237469192095, 95749849725794169816, 2169082695217727013712
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,1250)/2.
CROSSREFS
Sequence in context: A140441 A261385 A071881 * A279532 A157582 A241098
KEYWORD
nonn
AUTHOR
R. H. Hardin Mar 02 2009
STATUS
approved