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 A048477 #20 Sep 08 2022 08:44:57
%S A048477 1,7,25,73,193,481,1153,2689,6145,13825,30721,67585,147457,319489,
%T A048477 688129,1474561,3145729,6684673,14155777,29884417,62914561,132120577,
%U A048477 276824065,578813953,1207959553,2516582401,5234491393,10871635969,22548578305,46707769345
%N A048477 a(n) = T(5,n), array T given by A048472.
%C A048477 n-th difference of a(n), a(n-1), ..., a(0) is (6, 12, 18, ...).
%H A048477 Vincenzo Librandi, <a href="/A048477/b048477.txt">Table of n, a(n) for n = 0..1000</a>
%H A048477 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (5,-8,4).
%F A048477 a(n) = 6*n * 2^(n-1) + 1.
%F A048477 G.f.: (1 + 2*x - 2*x^2) / ((1 - x) * (1 - 2*x)^2).
%F A048477 a(n) = 5*a(n-1)-8*a(n-2)+4*a(n-3) for n>2. - _Colin Barker_, Feb 18 2016
%o A048477 (Magma) [6*n * 2^(n-1) + 1: n in [0..30]]; // _Vincenzo Librandi_, Sep 23 2011
%o A048477 (PARI) {a(n) = if( n<0, 0, 3 * n * 2^n + 1)}; /* _Michael Somos_, May 13 2014 */
%o A048477 (PARI) Vec((1+2*x-2*x^2)/((1-x)*(1-2*x)^2) + O(x^40)) \\ _Colin Barker_, Feb 18 2016
%Y A048477 Cf. A048472.
%K A048477 nonn,easy
%O A048477 0,2
%A A048477 _Clark Kimberling_