login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A157558 Half the number of length n integer sequences with sum zero and sum of squares 1352. 1
1, 9, 90, 4710, 294975, 12521313, 439040875, 13748247801, 422094067740, 12416563759270, 354721205123505, 9872974834469253, 263171856408106464, 6676220201317388190, 161958493217535635430, 3785772107967822217382 (list; graph; refs; listen; history; 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,1352)/2.

CROSSREFS

Sequence in context: A062815 A160569 A157545 * A157584 A128384 A077334

Adjacent sequences:  A157555 A157556 A157557 * A157559 A157560 A157561

KEYWORD

nonn

AUTHOR

R. H. Hardin (rhhardin(AT)att.net) Mar 02 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 13:30 EST 2012. Contains 205909 sequences.