login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A136649 Binomial transform of A014070: a(n) = Sum_{k=0..n} C(n,k)*C(2^k,k). 0
1, 3, 11, 81, 2089, 211107, 76211147, 95054910473, 410422012327681, 6211807332775516467, 334327967114349983723899, 64835852334793138873642165105, 45812640033676518721399820389451657 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

FORMULA

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

PROG

(PARI) {a(n)=sum(k=0, n, 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)), A134173.

Sequence in context: A163856 A099341 A129114 * A062580 A097495 A157980

Adjacent sequences:  A136646 A136647 A136648 * A136650 A136651 A136652

KEYWORD

nonn

AUTHOR

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

EXTENSIONS

Edited by Charles R Greathouse IV (charles.greathouse(AT)case.edu), Oct 28 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 20:13 EST 2012. Contains 205663 sequences.