Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A136506
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A136506 a(n) = C(2^n+2,n). +0
5
1, 4, 15, 120, 3060, 278256, 90858768, 105637584000, 436355999662176, 6431591598617108352, 340881559632021623909760, 65533747894341651530074060800, 46081376018330435634530315478453248 (list; graph; listen)
OFFSET

0,2

FORMULA

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

PROGRAM

(PARI) {a(n)=polcoeff(sum(i=0, n, (1+2^i*x +x*O(x^n))^2*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)); A136507.

Adjacent sequences: A136503 A136504 A136505 this_sequence A136507 A136508 A136509

Sequence in context: A081548 A009315 A027162 this_sequence A037447 A137654 A118908

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 October 16 00:31 EDT 2008. Contains 145098 sequences.


AT&T Labs Research