|
Search: id:A089467
|
|
| |
|
| 1, 2, 8, 52, 478, 5706, 83824, 1461944, 29510268, 676549450, 17361810016, 492999348348, 15345359136232, 519525230896322, 19005788951346240, 747102849650454256, 31404054519248544016, 1405608808807797838866
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
See A088956 for the definition of the hyperbinomial transform.
|
|
FORMULA
|
a(n) = sum(k=0, n, (n-k+1)^(n-k-1)*C(n, k)*A089466(k)). a(n) = sum(k=0, n, -(n-k-1)^(n-k-1)*C(n, k)*A089468(k)). a(n) = sum(m=0, n, sum(j=0, m, C(m, j)*C(n, n-m-j)*n^(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^(n-m-j)*(m+j)!/(-2)^j)/m!))
|
|
CROSSREFS
|
Cf. A089466, A089468, A088956.
Sequence in context: A007832 A111088 A006351 this_sequence A103239 A132228 A151879
Adjacent sequences: A089464 A089465 A089466 this_sequence A089468 A089469 A089470
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Paul D. Hanna (pauldhanna(AT)juno.com), Nov 08 2003
|
|
|
Search completed in 0.002 seconds
|
