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!)
A157581 Half the number of length n integer sequences with sum zero and sum of squares 4802. 1
1, 15, 390, 21010, 1806015, 123582921, 7932838172, 541388995092, 35637846633315, 2098170095389555, 113237331813959034, 5754386605886291022, 280189305372079613419, 13193562175797681608910, 603200922513642478421880 (list; graph; refs; listen; history; text; internal format)
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,4802)/2.
CROSSREFS
Sequence in context: A129615 A286139 A069990 * A143001 A250950 A366300
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 April 23 23:26 EDT 2024. Contains 371917 sequences. (Running on oeis4.)