Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A136505
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A136505 a(n) = C(2^n+1,n). +0
5
1, 3, 10, 84, 2380, 237336, 82598880, 99949406400, 422825581068000, 6318976181520699840, 337559127276933693852160, 65182103393445184131620004864, 45946437874792132748338425828443136 (list; graph; listen)
OFFSET

0,2

FORMULA

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

PROGRAM

(PARI) {a(n)=polcoeff(sum(i=0, n, (1+2^i*x +x*O(x^n))*log(1+2^i*x +x*O(x^n))^i/i!), n)}

CROSSREFS

Cf. A014070 (C(2^n, n)), A136506 (C(2^n+2, n)); A136507.

Sequence in context: A158033 A027159 A136554 this_sequence A006311 A034792 A135457

Adjacent sequences: A136502 A136503 A136504 this_sequence A136506 A136507 A136508

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 November 27 14:50 EST 2009. Contains 167570 sequences.


AT&T Labs Research