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!)
A157556 Half the number of length n integer sequences with sum zero and sum of squares 1152. 1
1, 3, 18, 3010, 166725, 8371713, 307008163, 8869151172, 244109996040, 6625340217595, 174712060895757, 4452494561526960, 108958868923534266, 2551477805087525055, 57187304932168982070, 1233918981730653994884 (list; graph; refs; listen; history; text; internal format)
OFFSET
2,2
LINKS
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,1152)/2.
CROSSREFS
Sequence in context: A291078 A335181 A297536 * A214442 A057133 A321249
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 21 05:50 EDT 2024. Contains 373540 sequences. (Running on oeis4.)