Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A136507
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A136507 a(n) = Sum_{k=0..n} C(2^(n-k) + k, n-k). +0
5
1, 3, 10, 71, 1925, 203904, 75214965, 94608676477, 409763735870986, 6208539881584781823, 334272186911271376874561, 64832512634295914941490910360, 45811927207957062190019240099653265 (list; graph; listen)
OFFSET

0,2

FORMULA

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

PROGRAM

(PARI) {a(n)=sum(k=0, n, binomial(2^(n-k)+k, n-k))} (PARI) /* a(n) = coefficient of x^n in o.g.f. series: */ {a(n)=polcoeff(sum(i=0, n, 1/(1-x-2^i*x^2 +x*O(x^n))*log(1+2^i*x +x*O(x^n))^i/i!), n)}

CROSSREFS

Cf. A014070 (C(2^n, n)), A136505 (C(2^n+1, n)), A136506 (C(2^n+2, n)); A136508, A136509.

Adjacent sequences: A136504 A136505 A136506 this_sequence A136508 A136509 A136510

Sequence in context: A002499 A047833 A047834 this_sequence A086846 A082245 A027159

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Jan 01 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