login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A157587 Half the number of length n integer sequences with sum zero and sum of squares 6050. 1
1, 3, 462, 41230, 2595765, 186323823, 13994329244, 1089068168952, 80599569668955, 5296880405561547, 320164718544367950, 18262041337319290446, 998477188502752352485, 52770671879708445120045, 2707901917377956941817496 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,2

LINKS

R. H. Hardin, Table of n, a(n) for n=2..50

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,6050)/2.

CROSSREFS

Sequence in context: A157601 A094454 A261004 * A054702 A140015 A342067

Adjacent sequences:  A157584 A157585 A157586 * A157588 A157589 A157590

KEYWORD

nonn

AUTHOR

R. H. Hardin Mar 02 2009

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 20 16:58 EDT 2022. Contains 353876 sequences. (Running on oeis4.)