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 A048497 #23 Sep 08 2022 08:44:57
%S A048497 1,2,8,28,84,228,580,1412,3332,7684,17412,38916,86020,188420,409604,
%T A048497 884740,1900548,4063236,8650756,18350084,38797316,81788932,171966468,
%U A048497 360710148,754974724,1577058308,3288334340,6845104132
%N A048497 a(n) = 2^(n-1)*(4*n - 6) + 4.
%C A048497 Equals binomial transform of A016813 preceded by a "1": (1, 1, 5, 9, 13, 21, ...). [_Gary W. Adamson_, Jan 13 2009]
%H A048497 Vincenzo Librandi, <a href="/A048497/b048497.txt">Table of n, a(n) for n = 0..1000</a>
%H A048497 <a href="/index/Rec">Index entries for linear recurrences with constant coefficients</a>, signature (5,-8,4).
%F A048497 From _Colin Barker_, Oct 07 2012: (Start)
%F A048497 a(n) = 5*a(n-1) - 8*a(n-2) + 4*a(n-3).
%F A048497 G.f.: (1 - 3*x + 6*x^2)/((1-x)*(1-2*x)^2). (End)
%t A048497 LinearRecurrence[{5,-8,4},{1,2,8},30] (* _Harvey P. Dale_, Apr 16 2019 *)
%o A048497 (Magma) [2^(n-1)*(4*n-6)+4: n in [0..30]]; // _Vincenzo Librandi_, Sep 23 2011
%Y A048497 a(n) = T(3, n), array T given by A048494.
%Y A048497 Cf. A016813. [_Gary W. Adamson_, Jan 13 2009]
%K A048497 nonn,easy
%O A048497 0,2
%A A048497 _Clark Kimberling_
%E A048497 Formula from _Ralf Stephan_, Jan 15 2004