|
| |
|
|
A157570
|
|
Half the number of length n integer sequences with sum zero and sum of squares 2888.
|
|
1
| |
|
|
1, 9, 114, 11430, 928665, 57312801, 2929653363, 133959064275, 6012597282660, 258520740868390, 10793900036914731, 439085564014381089, 17106142080255638592, 634240156516816014270, 22487281301691416873070
(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,2888)/2.
|
|
|
CROSSREFS
| Sequence in context: A165224 A012116 A157551 * A157233 A188976 A180913
Adjacent sequences: A157567 A157568 A157569 * A157571 A157572 A157573
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| R. H. Hardin (rhhardin(AT)att.net) Mar 02 2009
|
| |
|
|
