|
Search: id:A157544
|
|
|
| A157544 |
|
Half the number of length n integer sequences with sum zero and sum of squares 288. |
|
+0
1
|
|
| 1, 3, 18, 770, 20805, 522753, 9593507, 138576324, 1907158560, 25880343115, 341234146077, 4348150676532, 53202598238062, 622919366722485, 6980872709154870, 75312434538456228, 787522030868617855
(list; graph; listen)
|
|
|
OFFSET
|
2,2
|
|
|
LINKS
|
Ron 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,288)/2.
|
|
CROSSREFS
|
Sequence in context: A070953 A163261 A064846 this_sequence A000853 A065402 A131489
Adjacent sequences: A157541 A157542 A157543 this_sequence A157545 A157546 A157547
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Ron Hardin (rhhardin(AT)att.net) Mar 02 2009
|
|
|
Search completed in 0.002 seconds
|
