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 A351279 #18 Feb 07 2022 21:44:31
%S A351279 1,2,6,18,58,202,762,3114,13754,65386,332922,1806506,10398266,
%T A351279 63226858,404640250,2716838186,19083233210,139874994282,1067462826874,
%U A351279 8464760754602,69620304280890,592925117961450,5220996124450042,47467755352580650,445027186867923642
%N A351279 a(n) = Sum_{k=0..n} 2^k * k^(n-k).
%H A351279 Seiichi Manyama, <a href="/A351279/b351279.txt">Table of n, a(n) for n = 0..582</a>
%F A351279 G.f.: Sum_{k>=0} (2*x)^k/(1 - k*x).
%F A351279 a(n) ~ sqrt(2*Pi/(1 + LambertW(exp(1)*n/2))) * n^(n + 1/2) * exp(n/LambertW(exp(1)*n/2) - n) / LambertW(exp(1)*n/2)^(n + 1/2). - _Vaclav Kotesovec_, Feb 06 2022
%t A351279 a[0] = 1; a[n_] := Sum[2^k * k^(n-k), {k, 1, n}]; Array[a, 25, 0] (* _Amiram Eldar_, Feb 06 2022 *)
%o A351279 (PARI) a(n) = sum(k=0, n, 2^k*k^(n-k));
%o A351279 (PARI) my(N=40, x='x+O('x^N)); Vec(sum(k=0, N, (2*x)^k/(1-k*x)))
%Y A351279 Cf. A003101, A026898, A038125, A349962.
%K A351279 nonn,easy
%O A351279 0,2
%A A351279 _Seiichi Manyama_, Feb 06 2022