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!)
A157540 Half the number of length n integer sequences with sum zero and sum of squares 128. 1
1, 3, 6, 430, 8775, 114681, 1213471, 11685663, 110201400, 997307245, 8767514811, 75092781699, 615909156954, 4807634283375, 35885733707970, 258099905201634, 1799253706774203, 12198525957520155, 80576646822300850, 518883888358457370 (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,128)/2.

CROSSREFS

Sequence in context: A290368 A068375 A126297 * A179267 A171928 A308259

Adjacent sequences:  A157537 A157538 A157539 * A157541 A157542 A157543

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 June 29 21:48 EDT 2022. Contains 354913 sequences. (Running on oeis4.)