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 A280211 #26 Jan 01 2021 13:48:20
%S A280211 0,2,32,1536,262144,167772160,412316860416,3940649673949184,
%T A280211 147573952589676412928,21760664753063325144711168,
%U A280211 12676506002282294014967032053760,29243015907268149203883755326167580672,267608942382367477698428619271780338071764992,9727754898074489823563726246559579778829887006048256
%N A280211 a(n) = n*(2^(n^2)).
%C A280211 a(n) = n with the bits shifted to the left by n^2 places (new bits on the right hand side are zeros) i.e, a(n) = n<<(n**2).
%C A280211 a(n) is always even.
%C A280211 a(n) mod 32 = 0 for n>=2.
%H A280211 Indranil Ghosh, <a href="/A280211/b280211.txt">Table of n, a(n) for n = 0..50</a>
%H A280211 MSDN, <a href="https://msdn.microsoft.com/en-us/library/8xftzc7e(v=vs.100).aspx">Bitwise Left Shift Operator</a>
%H A280211 Stack Overflow <a href="http://stackoverflow.com/questions/141525/what-are-bitwise-shift-bit-shift-operators-and-how-do-they-work">Use of Bit Shifting Operators</a>
%F A280211 a(n) = n*(2^(n^2)).
%F A280211 a(n) = n*A002416(n). - _Omar E. Pol_, Jan 06 2017
%t A280211 Table[n*2^n^2,{n,0,20}] (* _Harvey P. Dale_, Jan 01 2021 *)
%o A280211 (Python) a=lambda n: n<<(n**2)
%Y A280211 Cf. A002416, A213541, A007745, A169810.
%K A280211 nonn,easy
%O A280211 0,2
%A A280211 _Indranil Ghosh_, Jan 06 2017