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!)
A221100 E.g.f. satisfies: A(x) = 1 + x*Sum_{n>=0} log(A(n*x))^n / n!. 1
1, 1, 2, 15, 248, 8440, 513144, 52356122, 8677146176, 2287135119744, 948641529992880, 614727594325073592, 618434779929242165856, 960690586903797786948288, 2293100087767812293312717088, 8373182505242530234213019810880, 46591358758492418174191908438641664 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Table of n, a(n) for n=0..16.

EXAMPLE

E.g.f.: A(x) = 1 + x + 2*x^2/2! + 15*x^3/3! + 248*x^4/4! + 8440*x^5/5! +...

where

A(x) = 1 + x + x*log(A(x)) + x*log(A(2*x))^2/2! + x*log(A(3*x))^3/3! + x*log(A(4*x))^4/4! + x*log(A(5*x))^5/5! +...

PROG

(PARI) {a(n)=local(A=1+x); for(i=1, n, A=1+x*sum(m=0, n, log( subst(A, x, m*x+x*O(x^n)) )^m/m!)); n!*polcoeff(A, n)}

for(n=0, 20, print1(a(n), ", "))

CROSSREFS

Cf. A221101.

Sequence in context: A180610 A156750 A292798 * A203310 A102555 A264907

Adjacent sequences: A221097 A221098 A221099 * A221101 A221102 A221103

KEYWORD

nonn

AUTHOR

Paul D. Hanna, Jan 01 2013

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 1 01:13 EST 2022. Contains 358453 sequences. (Running on oeis4.)