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 A116952 #19 Mar 13 2024 10:51:17
%S A116952 1,8,29,92,281,848,2549,7652,22961,68888,206669,620012,1860041,
%T A116952 5580128,16740389,50221172,150663521,451990568,1355971709,4067915132,
%U A116952 12203745401,36611236208,109833708629,329501125892,988503377681,2965510133048,8896530399149
%N A116952 a(n) = 3*a(n-1) + 5 with a(0) = 1.
%H A116952 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (4,-3).
%F A116952 a(n) = (7/2)*3^n-(5/2). - _Emeric Deutsch_, Apr 01 2006
%F A116952 a(n) = 4*a(n-1)-3*a(n-2). G.f.: (4*x+1) / ((x-1)*(3*x-1)). - _Colin Barker_, Jul 18 2013
%e A116952 The second term is 8 since a(1) = 3*a(0) + 5 = 3*1 + 5 = 8.
%p A116952 a:=n->(7*3^n-5)/2: seq(a(n),n=0..27);
%p A116952 a[0]:=1: for n from 1 to 27 do a[n]:=3*a[n-1]+5 od: seq(a[n],n=0..27);
%t A116952 a[0] := 1; a[n_] := 3a[n - 1] + 5; Table[a[n], {n, 0, 30}]
%t A116952 NestList[3#+5&,1,30] (* or *) LinearRecurrence[{4,-3},{1,8},30] (* _Harvey P. Dale_, Jul 20 2018 *)
%K A116952 nonn,easy
%O A116952 0,2
%A A116952 _Parthasarathy Nambi_, Mar 29 2006
%E A116952 More terms from _Emeric Deutsch_ and _Stefan Steinerberger_, Apr 01 2006
%E A116952 More terms from _Colin Barker_, Jul 18 2013