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 A036546 #23 Aug 29 2024 21:58:20
%S A036546 1,33,129,417,1281,3873,11649,34977,104961,314913,944769,2834337,
%T A036546 8503041,25509153,76527489,229582497,688747521,2066242593,6198727809,
%U A036546 18596183457,55788550401,167365651233,502096953729,1506290861217,4518872583681,13556617751073,40669853253249
%N A036546 a(n) = T(5,n), array T given by A048471.
%C A036546 n-th difference of a(n), a(n-1), ..., a(0) is 2^(n+4) for n=1, 2, 3, ...
%H A036546 Vincenzo Librandi, <a href="/A036546/b036546.txt">Table of n, a(n) for n = 0..1000</a>
%H A036546 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (4,-3).
%F A036546 a(n) = 16*3^n - 15. - _Ralf Stephan_, Feb 17 2004
%F A036546 From _Vincenzo Librandi_, Nov 11 2011: (Start)
%F A036546 a(n) = 3*a(n-1) + 30.
%F A036546 a(n) = 4*a(n-1) - 3*a(n-2).
%F A036546 G.f.: (1+29*x)/((1-x)*(1-3*x)). (End)
%F A036546 E.g.f.: exp(x)*(16*exp(2*x) - 15). - _Elmo R. Oliveira_, Aug 29 2024
%t A036546 LinearRecurrence[{4,-3},{1,33},30] (* _Harvey P. Dale_, Mar 16 2012 *)
%o A036546 (Magma) [16*3^n-15: n in [0..30]]; // _Vincenzo Librandi_, Nov 11 2011
%Y A036546 Cf. A048471.
%K A036546 nonn,easy
%O A036546 0,2
%A A036546 _Clark Kimberling_