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 A349601 #18 Nov 25 2021 08:52:09
%S A349601 1,1,4,32,391,6462,134974,3412187,101323674,3457536144,133333945461,
%T A349601 5734792007584,272197255745078,14133109419794601,796883164532719216,
%U A349601 48489515568651113516,3167153388603620859695,221021628292403019655418
%N A349601 E.g.f. satisfies: A(x) * log(A(x)) = exp(x*A(x)^2) - 1.
%H A349601 Seiichi Manyama, <a href="/A349601/b349601.txt">Table of n, a(n) for n = 0..361</a>
%F A349601 a(n) = Sum_{k=0..n} (2*n-k+1)^(k-1) * Stirling2(n,k).
%F A349601 a(n) ~ s * n^(n-1) / (sqrt(2*(1 + 2*r*s^2) - 2/(1 + log(s))) * exp(n) * r^n), where r = 0.2229533052706631261980294005821031136702825459439... and s = 1.759796045489338472919926226485178994146849909897... are roots of the system of equations exp(r*s^2) = 1 + s*log(s), 2*exp(r*s^2)*r*s = 1 + log(s). - _Vaclav Kotesovec_, Nov 25 2021
%t A349601 Table[Sum[(2*n - k + 1)^(k-1) * StirlingS2[n, k], {k, 0, n}], {n, 0, 20}] (* _Vaclav Kotesovec_, Nov 25 2021 *)
%o A349601 (PARI) a(n) = sum(k=0, n, (2*n-k+1)^(k-1)*stirling(n, k, 2));
%Y A349601 Cf. A216135, A349600, A349602.
%Y A349601 Cf. A349583, A349588.
%K A349601 nonn
%O A349601 0,3
%A A349601 _Seiichi Manyama_, Nov 22 2021