|
| |
|
|
A157595
|
|
Half the number of length n integer sequences with sum zero and sum of squares 7938.
|
|
1
| |
|
|
1, 9, 486, 26230, 2658825, 303936255, 29022562044, 2546840675268, 209628417451815, 15863225333113455, 1100628488842991790, 71323826984704710078, 4440654868991991482287, 268844012960749492143465
(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,7938)/2.
|
|
|
CROSSREFS
| Sequence in context: A061175 A166879 A128947 * A042415 A112910 A180585
Adjacent sequences: A157592 A157593 A157594 * A157596 A157597 A157598
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| R. H. Hardin (rhhardin(AT)att.net) Mar 02 2009
|
| |
|
|
