Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A136648
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A136648 Inverse binomial transform of A014070: a(n) = Sum_{k=0..n} (-1)^(n-k)*C(n,k)*C(2^k,k). +0
1
1, 1, 3, 43, 1625, 192785, 73792371, 94005141667, 408909577044065, 6204433373664395569, 334203804752658372354515, 64828498485572980097719939179, 45811084061472137471487315433296153 (list; graph; listen)
OFFSET

0,3

FORMULA

G.f.: A(x) = (1/(1+x))*Sum_{n>=0} [log(1 + (2^n+1)*x) - log(1+x)]^n / n!.

MAPLE

(PARI) {a(n)=sum(k=0, n, (-1)^(n-k)*binomial(n, k)*binomial(2^k, k))} (PARI) /* Using the g.f.: */ {a(n)=local(X=x+x*O(x^n)); polcoeff(sum(k=0, n, (log(1+(2^k+1)*X)-log(1+X))^k/k!)/(1+X), n)}

CROSSREFS

Cf. A014070 (C(2^n, n)), A134174.

Adjacent sequences: A136645 A136646 A136647 this_sequence A136649 A136650 A136651

Sequence in context: A099664 A093163 A141060 this_sequence A114337 A009720 A076361

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com) and Vladeta Jovovic (vladeta(AT)Eunet.yu), Jan 21 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified January 7 17:35 EST 2009. Contains 152824 sequences.


AT&T Labs Research