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 A036545 #23 Aug 29 2024 21:58:34
%S A036545 1,17,65,209,641,1937,5825,17489,52481,157457,472385,1417169,4251521,
%T A036545 12754577,38263745,114791249,344373761,1033121297,3099363905,
%U A036545 9298091729,27894275201,83682825617,251048476865,753145430609,2259436291841,6778308875537,20334926626625
%N A036545 a(n) = T(4,n), array T given by A048471.
%C A036545 n-th difference of a(n), a(n-1), ..., a(0) is 2^(n+3) for n=1, 2, 3, ...
%H A036545 Vincenzo Librandi, <a href="/A036545/b036545.txt">Table of n, a(n) for n = 0..1000</a>
%H A036545 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (4,-3).
%F A036545 a(n) = 8*3^n - 7. - _Ralf Stephan_, Feb 17 2004
%F A036545 From _Vincenzo Librandi_, Nov 11 2011: (Start)
%F A036545 a(n) = 3*a(n-1) + 14.
%F A036545 a(n) = 4*a(n-1) - 3*a(n-2).
%F A036545 G.f.: (1+13*x)/((1-x)*(1-3*x)). (End)
%F A036545 E.g.f.: exp(x)*(8*exp(2*x) - 7). - _Elmo R. Oliveira_, Aug 29 2024
%t A036545 LinearRecurrence[{4,-3},{1,17},30] (* _Harvey P. Dale_, Mar 05 2022 *)
%o A036545 (Magma) [8*3^n-7: n in [0..30]]; // _Vincenzo Librandi_, Nov 11 2011
%Y A036545 Cf. A048471.
%K A036545 nonn,easy
%O A036545 0,2
%A A036545 _Clark Kimberling_