Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A140051
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A140051 L.g.f.: A(x) = log(G(x)) where G(x) = g.f. of A060690(n) = C(2^n+n-1,n). +0
2
2, 16, 308, 14488, 1843232, 714580528, 917085102992, 4076698622618144, 64300718807613519968, 3649606003781552269341376, 752497581806524062754828125952, 567745591696108934746387351412913664 (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 + 16*x^2/2 + 308*x^3/3 + 14488*x^4/4 + 1843232*x^5/5 +...

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

G(x) = 1 + 2*x + 10*x^2 + 120*x^3 + 3876*x^4 +... + C(2^n+n-1,n)*x^n +...

PROGRAM

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

CROSSREFS

Cf. A140050, A060690.

Sequence in context: A009795 A112722 A009250 this_sequence A137729 A009100 A009109

Adjacent sequences: A140048 A140049 A140050 this_sequence A140052 A140053 A140054

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 10:07 EST 2008. Contains 151162 sequences.


AT&T Labs Research