login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A137154 a(n) = Sum_{k=0..n} binomial(2^k + n-k-1, n-k); equals the row sums of triangle A137153. 2
1, 2, 4, 9, 24, 79, 331, 1803, 12954, 123983, 1592513, 27604172, 648528166, 20722205191, 903019659239, 53792176322629, 4388683843024734, 491232972054490915, 75545748143323475653, 15984344095578889888206 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
Matrix inverse of A137153 is A137156.
LINKS
FORMULA
G.f.: Sum_{n>=0} x^n/(1-x)^(2^n). - Paul D. Hanna, Sep 15 2009
G.f.: Sum_{n>=0} ( (-log(1 - x))^n / n! ) / (1 - 2^n*x). - Paul D. Hanna, Jan 23 2021
MATHEMATICA
Table[Sum[Binomial[2^(n-k) + k - 1, k], {k, 0, n}], {n, 0, 20}] (* Vaclav Kotesovec, Jan 23 2021 *)
PROG
(PARI) a(n)=sum(k=0, n, binomial(2^k+n-k-1, n-k))
(PARI) {a(n)=local(A=sum(k=0, n, x^k/(1-x+x*O(x^n))^(2^k))); polcoeff(A, n)} \\ Paul D. Hanna, Sep 15 2009
CROSSREFS
Sequence in context: A135934 A343032 A210342 * A098448 A006406 A097656
KEYWORD
nonn
AUTHOR
Paul D. Hanna, Jan 24 2008
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)