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!)
A157582 Half the number of length n integer sequences with sum zero and sum of squares 5000. 1
1, 3, 222, 23430, 2211435, 165640041, 11463980983, 700674124347, 41384377023300, 2326405435793384, 127560765651968055, 6827700441824422953, 350130844722624976920, 17081201454932094454170, 796830250007891403178002 (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,5000)/2.

CROSSREFS

Sequence in context: A071881 A157557 A279532 * A241098 A254157 A131493

Adjacent sequences:  A157579 A157580 A157581 * A157583 A157584 A157585

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 18 00:59 EDT 2022. Contains 353779 sequences. (Running on oeis4.)