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 A014898 #41 Jun 15 2025 11:25:16
%S A014898 1,17,258,3874,58115,871731,13075972,196139588,2942093829,44131407445,
%T A014898 661971111686,9929566675302,148943500129543,2234152501943159,
%U A014898 33512287529147400,502684312937211016,7540264694058165257,113103970410872478873,1696559556163087183114,25448393342446307746730
%N A014898 a(1)=1, a(n) = 15*a(n-1) + n.
%H A014898 Vincenzo Librandi, <a href="/A014898/b014898.txt">Table of n, a(n) for n = 1..200</a>
%H A014898 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (17,-31,15).
%F A014898 a(n) = 17*a(n-1) - 31*a(n-2) + 15*a(n-3); a(1)=1, a(2)=17, a(3)=258. - _Vincenzo Librandi_, Oct 20 2012
%F A014898 From _Elmo R. Oliveira_, Mar 29 2025: (Start)
%F A014898 G.f.: x/((1-15*x)*(1-x)^2).
%F A014898 E.g.f.: exp(x)*(15*exp(14*x) - 14*x - 15)/196.
%F A014898 a(n) = (15^(n+1) - 14*n - 15)/196. (End)
%t A014898 LinearRecurrence[{17, -31, 15}, {1, 17, 258}, 20] (* _Vincenzo Librandi_, Oct 20 2012 *)
%t A014898 nxt[{n_,a_}]:={n+1,15a+n+1}; NestList[nxt,{1,1},20][[;;,2]] (* _Harvey P. Dale_, Jun 15 2025 *)
%o A014898 (Magma) I:=[1, 17, 258]; [n le 3 select I[n] else 17*Self(n-1) - 31*Self(n-2) + 15*Self(n-3): n in [1..20]]; // _Vincenzo Librandi_, Oct 20 2012
%Y A014898 Row n=15 of A126885.
%K A014898 nonn,easy
%O A014898 1,2
%A A014898 _N. J. A. Sloane_, _Olivier Gérard_