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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A196125 E.g.f. satisfies: A(x) = Sum_{n>=0} exp(x*A(x)^(2*n) - 1)/n!. 0
 1, 1, 5, 61, 1241, 35321, 1293565, 57977333, 3074915569, 188387127793, 13093624617781, 1018008272854189, 87546809210311753, 8251472362124225001, 845856237057331033773, 93695948684292621079141, 11153023640354668717741793, 1419786005695986152133964769 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Table of n, a(n) for n=0..17. FORMULA E.g.f. satisfies: A(x) = Sum_{n>=0} exp(A(x)^(2*n) - 1)*x^n/n!. EXAMPLE E.g.f.: A(x) = 1 + x + 5*x^2/2! + 61*x^3/3! + 1241*x^4/4! + 35321*x^5/5! +... where A(x) = exp(x-1) + exp(x*A(x)^2-1) + exp(x*A(x)^4-1)/2! + exp(x*A(x)^6-1)/3! +... Also, A(x) = 1 + exp(A(x)^2-1)*x + exp(A(x)^4-1)*x^2/2! + exp(A(x)^6-1)*x^3/3! +... PROG (PARI) {a(n)=local(A=1+x, X=x+x*O(x^n)); for(i=1, n, A=1+sum(m=1, n, exp(A^(2*m)-1)*X^m/m!)); n!*polcoeff(A, n)} (PARI) {a(n)=local(A=1+x); for(i=1, n, A=sum(m=0, 2*n+10, exp(x*A^(2*m)-1+x*O(x^n))/m!)); round(n!*polcoeff(A, n))} CROSSREFS Cf. A195895. Sequence in context: A217821 A009825 A065919 * A345103 A096537 A115047 Adjacent sequences: A196122 A196123 A196124 * A196126 A196127 A196128 KEYWORD nonn AUTHOR Paul D. Hanna, Sep 27 2011 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.

Last modified September 27 11:36 EDT 2023. Contains 365688 sequences. (Running on oeis4.)