Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A140050
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A140050 L.g.f.: A(x) = log(G(x)) where G(x) = g.f. of A014070(n) = C(2^n,n). +0
2
2, 8, 140, 6840, 988272, 447403472, 660627632240, 3275795875152672, 55865676874553471264, 3342534504414732132234688, 713146571770256922167459951616, 549740788325926349073175414573702656 (list; graph; listen)
OFFSET

1,1

FORMULA

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

EXAMPLE

A(x) = 2*x + 8*x^2/2 + 140*x^3/3 + 6840*x^4/4 + 988272*x^5/5 +...

A(x) = log(G(x)) where G(x) = g.f. of A014070:

G(x) = 1 + 2*x + 6*x^2 + 56*x^3 + 1820*x^4 +... + C(2^n,n)*x^n +...

PROGRAM

(PARI) {a(n)=n*polcoeff(log(sum(k=0, n, binomial(2^k, k)*x^k)+x*O(x^n)), n)}

CROSSREFS

Cf. A140051, A014070.

Sequence in context: A058343 A111827 A045330 this_sequence A009817 A124105 A079613

Adjacent sequences: A140047 A140048 A140049 this_sequence A140051 A140052 A140053

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), May 02 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 December 3 16:57 EST 2008. Contains 151279 sequences.


AT&T Labs Research