|
Search: id:A089466
|
|
| |
|
| 1, 1, 3, 18, 163, 1950, 28821, 505876, 10270569, 236644092, 6098971555, 173823708696, 5427760272507, 184267682837992, 6757353631762293, 266191329601854000, 11210291102456374801, 502602430218071545104
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
See A088956 for the definition of the hyperbinomial transform.
|
|
FORMULA
|
A089467(n) = sum(k=0, n, (n-k+1)^(n-k-1)*C(n, k)*a(k)). a(n) = sum(m=0, n, sum(j=0, m, C(m, j)*C(n, n-m-j)*(n-1)^(n-m-j)*(m+j)!/(-2)^j)/m!)).
|
|
PROGRAM
|
(PARI) a(n)=if(n<0, 0, sum(m=0, n, sum(j=0, m, binomial(m, j)*binomial(n, n-m-j)*(n-1)^(n-m-j)*(m+j)!/(-2)^j)/m!))
|
|
CROSSREFS
|
Cf. A089467, A088956.
Sequence in context: A065058 A032031 A127646 this_sequence A107403 A053513 A138211
Adjacent sequences: A089463 A089464 A089465 this_sequence A089467 A089468 A089469
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Paul D. Hanna (pauldhanna(AT)juno.com), Nov 08 2003
|
|
|
Search completed in 0.002 seconds
|
