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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A157598 Half the number of length n integer sequences with sum zero and sum of squares 8712. 1
1, 3, 198, 27930, 3388365, 475265259, 48238917727, 3831384879156, 290324159283540, 21674347016566915, 1571698374562433667, 110138942653526323056, 7411777323163714916688, 477289870722013730288040 (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,8712)/2.

CROSSREFS

Sequence in context: A101382 A000724 A157565 * A023310 A054701 A140654

Adjacent sequences:  A157595 A157596 A157597 * A157599 A157600 A157601

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 17 16:29 EST 2012. Contains 206050 sequences.