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 A007758 #60 Jun 28 2022 10:59:22
%S A007758 0,2,16,72,256,800,2304,6272,16384,41472,102400,247808,589824,1384448,
%T A007758 3211264,7372800,16777216,37879808,84934656,189267968,419430400,
%U A007758 924844032,2030043136,4437573632,9663676416,20971520000,45365592064,97844723712,210453397504
%N A007758 a(n) = 2^n*n^2.
%C A007758 "The traveling salesman problem can be solved in time O(n^2 2^n) (where n is the size of the network to visit)." [Wikipedia] - _Jonathan Vos Post_, Apr 10 2006
%C A007758 Satisfies Benford's law [Theodore P. Hill, Personal communication, Feb 06, 2017]. - _N. J. A. Sloane_, Feb 08 2017
%D A007758 Arno Berger and Theodore P. Hill. An Introduction to Benford's Law. Princeton University Press, 2015.
%D A007758 Konrad Knopp, Theory and Application of Infinite Series, Dover, p. 269.
%H A007758 Vincenzo Librandi, <a href="/A007758/b007758.txt">Table of n, a(n) for n = 0..1000</a>
%H A007758 Konrad Knopp, <a href="http://www.hti.umich.edu/cgi/t/text/text-idx?sid=b88432273f115fb346725f1a42422e19;c=umhistmath;idno=ACM1954.0001.001">Theorie und Anwendung der unendlichen Reihen</a>, Berlin, J. Springer, 1922. (Original german edition of "Theory and Application of Infinite Series")
%H A007758 Wikipedia, <a href="http://en.wikipedia.org/wiki/Complexity">Complexity</a>.
%H A007758 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (6,-12,8).
%H A007758 <a href="/index/Be#Benford">Index entries for sequences related to Benford's law</a>.
%F A007758 From _Henry Bottomley_, Jun 13 2001: (Start)
%F A007758 a(n) = 2*A014477(n-1).
%F A007758 G.f.: 2*x(1+2*x)/(1-2*x)^3.
%F A007758 Binomial transform of A002939.
%F A007758 Inverse binomial transform of A062189. (End)
%F A007758 Sum_{n>=1} 1/a(n) = Pi^2/12 - (1/2)*(log(2))^2. - _Benoit Cloitre_, Apr 05 2002
%F A007758 a(n) = Sum_{k=1..n} k*2^k. - _Zerinvary Lajos_, Oct 09 2006
%F A007758 E.g.f.: exp(2*x)*(2*x + 4*x^2). - _Geoffrey Critzer_, Aug 28 2013
%F A007758 Sum_{n>=1} (-1)^(n+1)/a(n) = -Li_2(-1/2) (A355234). - _Amiram Eldar_, Jun 28 2022
%p A007758 seq(seq(k^n*n^k, k=2..2), n=0..25); and seq(2^n*n^2, n=0..25); # _Zerinvary Lajos_, Jul 01 2007
%t A007758 Table[n^2 * 2^n, {n, 0, 31}] (* _Alonso del Arte_, Oct 22 2014 *)
%t A007758 LinearRecurrence[{6,-12,8},{0,2,16},30] (* _Harvey P. Dale_, Jan 27 2017 *)
%o A007758 (Magma) [2^n*n^2: n in [0..30]]; // _Vincenzo Librandi_, Oct 27 2011
%o A007758 (PARI) a(n)=n^2<<n \\ _Charles R Greathouse IV_, Oct 28 2014
%Y A007758 Cf. A014477, A248917, A355234.
%K A007758 nonn,easy
%O A007758 0,2
%A A007758 David J. Snook (ua532(AT)freenet.victoria.bc.ca)