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 A109747 #26 Dec 20 2019 05:52:18
%S A109747 1,2,3,3,2,3,5,-4,5,55,-212,201,2381,-15350,35183,145359,-1821438,
%T A109747 8117231,-521487,-278996548,2261959961,-7554900397,-34727188796,
%U A109747 690775844605,-4901767330647,10921820177234,179314430713387,-2668801066419061,18150518618843778
%N A109747 E.g.f.: exp(-exp(-x)+1+x).
%C A109747 Equals double binomial transform of A014182. - _Gary W. Adamson_, Dec 31 2008
%F A109747 a(n) = Sum_{k=0..n} (-1)^(n-k)*Stirling2(n, k)*A000522(k).
%F A109747 G.f. = (1 - x^2 * Sum_{k>0} k * x^k / ((1 + x) * (1 + 2*x) + ... (1 + k*x))) / (1 - x)^2. - _Michael Somos_, Nov 07 2014
%F A109747 G.f.: 1/(1-x*Q(0)), where Q(k)= 1 + x/(1 - x - x*(k+1)/(x - 1/Q(k+1))); (continued fraction). - _Sergei N. Gladkovskii_, May 19 2013
%F A109747 G.f.: 1/W(0), where W(k) = 1 - x - x/(1 + x*(k+1)/W(k+1) ); (continued fraction). - _Sergei N. Gladkovskii_, Nov 07 2014
%F A109747 a(n) = exp(1) * (-1)^n * Sum_{k>=0} (-1)^k * (k - 1)^n / k!. - _Ilya Gutkovskiy_, Dec 20 2019
%e A109747 G.f. = 1 + 2*x + 3*x^2 + 3*x^3 + 2*x^4 + 3*x^5 + 5*x^6 - 4*x^7 + 5*x^8 + 55*x^9 + ...
%p A109747 G:=exp(-exp(-x)+1+x): Gser:=series(G,x=0,32): seq(n!*coeff(Gser,x,n),n=0..28); # _Emeric Deutsch_, Apr 10 2006
%t A109747 With[{nn=30},CoefficientList[Series[Exp[-Exp[-x]+1+x],{x,0,nn}],x] Range[ 0,nn]!] (* _Harvey P. Dale_, Jun 22 2018 *)
%Y A109747 Cf. A080094.
%Y A109747 Cf. A014182. - _Gary W. Adamson_, Dec 31 2008
%K A109747 easy,sign
%O A109747 0,2
%A A109747 _Franklin T. Adams-Watters_ and _Vladeta Jovovic_, Aug 10 2005
%E A109747 More terms from _Emeric Deutsch_, Apr 10 2006