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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A157534 Half the number of length n integer sequences with sum zero and sum of squares 8. 1
1, 3, 6, 30, 135, 441, 1183, 2871, 6660, 15070, 33231, 70863, 145236, 285390, 537930, 974746, 1703043, 2878101, 4719220, 7529340, 11718861, 17834223, 26591841, 38918025, 55995550, 79317576, 110749653, 152600581, 207702930, 279504060 (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,8)/2.

CROSSREFS

Sequence in context: A136946 A125521 A090932 * A133799 A088436 A088506

Adjacent sequences:  A157531 A157532 A157533 * A157535 A157536 A157537

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 17:35 EST 2012. Contains 206061 sequences.