|
Search: id:A133990
|
|
|
| A133990 |
|
a(n) = Sum_{k=0..n} (-1)^(n-k)*binomial(n,k)*binomial(2^k+n-1,n). |
|
+0
1
|
|
| 1, 1, 5, 71, 2747, 306861, 106709627, 123122238887, 492425723170553, 7012142056418141897, 361269845371107759765065, 68033187103968192731087467135, 47171609221094330538117045468744655
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
FORMULA
|
a(n) = (1/n!)*Sum_{k=0..n} (-1)^(n-k)*Stirling1(n,k)*(2^k-1)^n. G.f.: Sum_{n>=0} (-ln(1-(2^n-1)*x))^n/n!.
|
|
MAPLE
|
A133990 := proc(n) add((-1)^(n-k)*binomial(n, k)*binomial(2^k+n-1, n), k=0..n) ; end: seq(A133990(n), n=0..15) ; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jan 30 2008
|
|
CROSSREFS
|
Adjacent sequences: A133987 A133988 A133989 this_sequence A133991 A133992 A133993
Sequence in context: A064752 A033507 A092250 this_sequence A120808 A092204 A079874
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Paul Hanna and Vladeta Jovovic (vladeta(AT)Eunet.yu), Jan 21 2008
|
|
EXTENSIONS
|
More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jan 30 2008
|
|
|
Search completed in 0.002 seconds
|
