login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A141152 L.g.f.: A(x) = log( 1 + Sum_{n>=1} n^(n-1)*x^n ) = Sum_{n>=1} a(n)*x^n/n. 2
1, 3, 22, 219, 2771, 42432, 762539, 15736131, 366842002, 9536745963, 273601703035, 8587640290656, 292752138541643, 10772040284616075, 425539049950420682, 17963758770051942339, 807032690733694275307 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Vaclav Kotesovec, Table of n, a(n) for n = 1..380

FORMULA

a(n) ~ n^n. - Vaclav Kotesovec, May 30 2019

EXAMPLE

L.g.f.: A(x) = x + 3*x^2/2 + 22*x^3/3 + 219*x^4/4 + 2771*x^5/5 +...

exp(A(x)) = 1 + x + 2*x^2 + 9*x^3 + 64*x^4 + 625*x^5 + 7776*x^6 +...

PROG

(PARI) {a(n)=polcoeff(x*deriv(log(Ser(concat(1, vector(n+1, k, k^(k-1)))))), n)}

CROSSREFS

Cf. A141151.

Sequence in context: A340474 A079489 A190526 * A341476 A303190 A173142

Adjacent sequences: A141149 A141150 A141151 * A141153 A141154 A141155

KEYWORD

nonn

AUTHOR

Paul D. Hanna, Jun 11 2008

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 7 10:26 EST 2022. Contains 358656 sequences. (Running on oeis4.)