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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A157593 Half the number of length n integer sequences with sum zero and sum of squares 7442. 1
1, 9, 378, 37830, 3403815, 290684541, 23648592268, 2009304033948, 165069279069345, 12108533607540535, 813240975212887518, 51447280837022648370, 3118521194576489150631, 182797738828031587273965 (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,7442)/2.

CROSSREFS

Sequence in context: A195518 A051848 A157567 * A157602 A124042 A012191

Adjacent sequences:  A157590 A157591 A157592 * A157594 A157595 A157596

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 14 20:13 EST 2012. Contains 205663 sequences.