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 A176662 #24 Oct 05 2019 14:06:40
%S A176662 2,7,14,40,104,256,608,1408,3200,7168,15872,34816,75776,163840,352256,
%T A176662 753664,1605632,3407872,7208960,15204352,31981568,67108864,140509184,
%U A176662 293601280,612368384,1275068416,2650800128,5502926848,11408506880,23622320128,48855252992
%N A176662 a(0)=2, a(1)=7, and a(n) = (3*n+1)*2^(n-1) if n > 1.
%C A176662 The sequence appears on the main diagonal of the array defined by A123167 in the first row and successive differences in followup rows:
%C A176662 2, 3, 10, 7, 18, 11, 26, 15, 34, 19, ... A123167
%C A176662 1, 7, -3, 11, -7, 15, -11, 19, -15, 23, ... first diff
%C A176662 6, -10, 14, -18, 22 -26, 30, -34, 38, ... second diff
%C A176662 -16, 24, -32, 40, -48, 56, -64, 72, -80, ... third diff
%H A176662 Vincenzo Librandi, <a href="/A176662/b176662.txt">Table of n, a(n) for n = 0..1000</a>
%H A176662 <a href="/index/Rec">Index entries for linear recurrences with constant coefficients</a>, signature (4,-4).
%F A176662 a(n) mod 9 = A010710(n-1), n > 2.
%F A176662 a(2n) + a(2n+1) = 9, 54, 360, 2016, ...
%F A176662 a(n) - 2*a(n-1) = 12*A131577(n-2), n > 1.
%F A176662 a(n) = 4*a(n-1) - 4*a(n-2), n > 3.
%F A176662 G.f.: (-6*x^2+12*x^3+2-x)/(1-2*x)^2.
%t A176662 LinearRecurrence[{4,-4},{2,7,14,40},40] (* or *) Join[{2,7},Table[ (3n+1) 2^(n-1),{n,2,40}]] (* _Harvey P. Dale_, Oct 05 2019 *)
%K A176662 nonn,easy
%O A176662 0,1
%A A176662 _Paul Curtz_, Apr 23 2010
%E A176662 Edited by _R. J. Mathar_, Jun 30 2010