Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A136465
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A136465 Row 0 of square array A136462: a(n) = C(2^(n-1), n) for n>=0. +0
5
1, 1, 1, 4, 70, 4368, 906192, 621216192, 1429702652400, 11288510714272000, 312268282598377321216, 30813235422145714150738944, 11005261717918037175659349191168 (list; graph; listen)
OFFSET

0,4

COMMENT

a(n) is found in row n, column 0, of triangle A136467 for n>=0.

FORMULA

a(n) = [x^n] Sum_{i>=0} (1/2)^i * log(1 + 2^i*x)^i/i!.

PROGRAM

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

CROSSREFS

Cf. A136462; other rows: A014070, A136466, A101346; A136467.

Adjacent sequences: A136462 A136463 A136464 this_sequence A136466 A136467 A136468

Sequence in context: A065573 A101841 A061609 this_sequence A047939 A088693 A133003

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Dec 31 2007

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