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 A360474 #12 Feb 17 2023 16:02:50
%S A360474 1,1,7,94,1921,53036,1849789,78070462,3869909537,220427550712,
%T A360474 14188370562901,1018570771664546,80692202644742737,
%U A360474 6992855583524143204,658076908751441373965,66833181471569822199886,7285736943975575120653249,848589321771735983890457072
%N A360474 E.g.f. satisfies A(x) = exp( x * A(x)^2 * exp(x * A(x)^2) ).
%F A360474 a(n) = Sum_{k=0..n} k^(n-k) * (2*n+1)^(k-1) * binomial(n,k).
%F A360474 a(n) ~ 2^(n - 1/2) * n^(n-1) * s^(2*n + 1) * log(s)^(n + 1/2) / (sqrt(1 + 2*log(s) - 4*log(s)^2) * exp(n) * (1 - 2*log(s))^n), where s = 1.473428520956658037187728756446912746332041803082... is the root of the equation 2*log(s)*(1 + LambertW(log(s))) = 1. - _Vaclav Kotesovec_, Feb 17 2023
%t A360474 Join[{1}, Table[Sum[k^(n-k) * (2*n+1)^(k-1) * Binomial[n,k], {k,0,n}], {n,1,20}]] (* _Vaclav Kotesovec_, Feb 17 2023 *)
%o A360474 (PARI) a(n) = sum(k=0, n, k^(n-k)*(2*n+1)^(k-1)*binomial(n, k));
%Y A360474 Cf. A162695, A360473.
%K A360474 nonn
%O A360474 0,3
%A A360474 _Seiichi Manyama_, Feb 08 2023