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 A059162 #9 Oct 07 2015 11:20:42
%S A059162 12,48,144,384,960,2304,5376,12288,27648,61440,135168,294912,638976,
%T A059162 1376256,2949120,6291456,13369344,28311552,59768832,125829120,
%U A059162 264241152,553648128,1157627904,2415919104,5033164800,10468982784,21743271936,45097156608,93415538688
%N A059162 A hierarchical sequence (S(W'2{3}*c) - see A059126).
%H A059162 Colin Barker, <a href="/A059162/b059162.txt">Table of n, a(n) for n = 0..1000</a>
%H A059162 J. Wallgren, <a href="/A059126/a059126.txt">Hierarchical sequences</a>
%H A059162 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (4,-4).
%F A059162 a(n) = 12*A001787(n).
%F A059162 From _Colin Barker_, Oct 07 2015: (Start)
%F A059162 a(n) = 3*(2^(2+n)*(1+n)).
%F A059162 a(n) = 4*a(n-1)-4*a(n-2) for n>1.
%F A059162 G.f.: 12 / (2*x-1)^2.
%F A059162 (End)
%o A059162 (PARI) Vec(12/(2*x-1)^2 + O(x^40)) \\ _Colin Barker_, Oct 07 2015
%K A059162 easy,nonn
%O A059162 0,1
%A A059162 _Jonas Wallgren_, Feb 02 2001