This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A141209 #29 Jan 31 2025 08:22:23
%S A141209 1,1,2,9,64,620,7626,113792,1997192,40316544,920271840,23438308872,
%T A141209 658947505272,20270099889624,677226678369528,24420959694718680,
%U A141209 945370712175873216,39103903755819561984,1721215383181421110848,80329148928437231089152
%N A141209 E.g.f. satisfies A(x)^A(x) = 1/(1 - x*A(x)).
%C A141209 Generally, if e.g.f. A(x) satisfies A(x)^A(x) = 1/(1-x*A(x)^p), then a(n) ~ s*sqrt((s^s-1)/(p*(s^s-1)*(p*s^s-1)-s)) * n^(n-1) * (s^(p+s)/(s^s-1))^n / exp(n), where s is the root of the equation (1+log(s))*s = (s^s-1)*p. - _Vaclav Kotesovec_, Dec 28 2013
%H A141209 G. C. Greubel, <a href="/A141209/b141209.txt">Table of n, a(n) for n = 0..385</a>
%F A141209 From _Paul D. Hanna_, Jul 08 2009: (Start)
%F A141209 (1) a(n) = Sum_{k=0..n} (n-k+1)^(k-1) *(-1)^(n-k) *Stirling1(n,k).
%F A141209 Let A(x)^m = Sum_{n>=0} a(n,m)*x^n/n!, then
%F A141209 (2) a(n,m) = Sum_{k=0..n} m*(n-k+m)^(k-1) *(-1)^(n-k) *Stirling1(n,k) ;
%F A141209 which is equivalent to the following:
%F A141209 (3) a(n,m) = Sum_{k=0..n} m*(n-k+m)^(k-1) * {[x^(n-k)] Product_{j=1..n-1} (1+j*x)};
%F A141209 (4) a(n,m) = n!*Sum_{k=0..n} m*(n-k+m)^(k-1) * {[x^(n-k)] (-log(1-x)/x)^k/k!}.
%F A141209 (End)
%F A141209 Limit_{n->oo} a(n)^(1/n)/n = exp((2*r-1)/(1-r))*(1+(1-r)*exp(r/(r-1))) = 0.97848198198076..., where r = 0.42324001455512542... is the root of the equation exp(r/(1-r)) = (r-1)/r*(r + LambertW(-1,-r*exp(-r))). - _Vaclav Kotesovec_, Sep 17 2013
%F A141209 a(n) ~ s*sqrt((s^s-1)/((s^s-1)^2-s)) * n^(n-1) * (s^(1+s)/(s^s-1))^n / exp(n), where s = 2.083029805648017585241865819... is the root of the equation (1+log(s))*s = (s^s-1). - _Vaclav Kotesovec_, Dec 28 2013
%e A141209 E.g.f.: A(x) = 1 + x + 2*x^2/2! + 9*x^3/3! + 64*x^4/4! + 620*x^5/5! +...
%t A141209 Table[Sum[(n-k+1)^(k-1)*Abs[StirlingS1[n,k]], {k, 0, n}], {n, 0, 20}] (* _Vaclav Kotesovec_, Sep 17 2013 *)
%t A141209 E^((2*r-1)/(1-r))*(1+(1-r)*E^(r/(r-1)))/.FindRoot[E^(r/(1-r))==(r-1)/r*(r+LambertW[-1,-r*E^(-r)]), {r,1/2}, WorkingPrecision->50] (* program for numerical value of the limit n->infinity a(n)^(1/n)/n, _Vaclav Kotesovec_, Sep 17 2013 *)
%o A141209 (PARI) {a(n)=local(A=1+x);for(i=0,n,A=exp(-log(1-x*(A+O(x^n)))/A));n!*polcoeff(A,n)}
%o A141209 (PARI) {a(n,m=1)=sum(k=0,n,m*(n-k+m)^(k-1)*polcoeff(prod(j=1,n-1,1+j*x),n-k))} \\ _Paul D. Hanna_, Jul 08 2009
%o A141209 (PARI) {a(n,m=1)=n!*sum(k=0,n,m*(n-k+m)^(k-1)*polcoeff((-log(1-x+x*O(x^n))/x)^k/k!,n-k))} \\ _Paul D. Hanna_, Jul 08 2009
%o A141209 (PARI) {a(n,m=1)=sum(k=0,n,m*(n-k+m)^(k-1)*(-1)^(n-k)*stirling(n,k,1))} \\ _Paul D. Hanna_, Jul 08 2009
%Y A141209 Cf. A216135, A216136, A229237, A008275 (Stirling1), A141209 (A162655), A191908.
%K A141209 nonn
%O A141209 0,3
%A A141209 _Paul D. Hanna_, Jul 01 2008