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 A062971 #56 Mar 13 2023 07:22:05
%S A062971 1,2,16,216,4096,100000,2985984,105413504,4294967296,198359290368,
%T A062971 10240000000000,584318301411328,36520347436056576,2481152873203736576,
%U A062971 182059119829942534144,14348907000000000000000,1208925819614629174706176,108428035605965932354207744
%N A062971 a(n) = (2*n)^n.
%C A062971 Shift n^n left n bits.
%C A062971 Also the number of input-closed output-Boolean Moore machines on n states. - _David Spivak_, Feb 14 2020
%H A062971 Harry J. Smith, <a href="/A062971/b062971.txt">Table of n, a(n) for n = 0..100</a>
%F A062971 E.g.f.: -(2*x*e^(-W(-2*x)))/(W(-2*x)*(W(-2*x)+1)), W(x) is Lambert's function. - _Vladimir Kruchinin_, May 09 2013
%F A062971 E.g.f.: 1/(1 + LambertW(-2*x)). - _Vaclav Kotesovec_, Dec 21 2014
%F A062971 Limit_{n->oo} a(n+1)/(n*a(n)) = 2*e. - _Stefano Spezia_, Mar 13 2023
%e A062971 n=3: 3^3 shifted three bits to the left is 216 because 3^3 in binary is: [1, 1, 0, 1, 1] and 216 in binary is: [1, 1, 0, 1, 1, 0, 0, 0].
%p A062971 a:= n-> (2*n)^n: seq(a(n), n=0..15); # _Zerinvary Lajos_, Jan 01 2009
%t A062971 Join[{1}, Table[(2*n)^n, {n,1,50}]] (* _G. C. Greubel_, Nov 10 2017 *)
%o A062971 (PARI) for(n=0, 20, print1(shift(n^n,n), ", "))
%Y A062971 Column k=1 of A246070.
%Y A062971 Cf. A019762 (2*e).
%K A062971 easy,nonn
%O A062971 0,2
%A A062971 _Jason Earls_, Jul 23 2001
%E A062971 New description from _Vladeta Jovovic_, Mar 08 2003