cp's OEIS Frontend

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.

A014897 a(1)=1, a(n) = 14*a(n-1) + n.

This page as a plain text file.
%I A014897 #38 Apr 14 2025 06:34:18
%S A014897 1,16,227,3182,44553,623748,8732479,122254714,1711566005,23961924080,
%T A014897 335466937131,4696537119846,65751519677857,920521275490012,
%U A014897 12887297856860183,180422169996042578,2525910379944596109,35362745319224345544,495078434469140837635,6931098082567971726910
%N A014897 a(1)=1, a(n) = 14*a(n-1) + n.
%H A014897 Vincenzo Librandi, <a href="/A014897/b014897.txt">Table of n, a(n) for n = 1..200</a>
%H A014897 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (16,-29,14).
%F A014897 a(1)=1, a(2)=16, a(3)=227, a(n) = 16*a(n-1) - 29*a(n-2) + 14*a(n-3). - _Vincenzo Librandi_, Oct 20 2012
%F A014897 From _Elmo R. Oliveira_, Mar 29 2025: (Start)
%F A014897 G.f.: x/((1-14*x)*(1-x)^2).
%F A014897 E.g.f.: exp(x)*(14*exp(13*x) - 13*x - 14)/169.
%F A014897 a(n) = (14^(n+1) - 13*n - 14)/169. (End)
%t A014897 LinearRecurrence[{16, -29, 14}, {1, 16, 227}, 20] (* _Vincenzo Librandi_, Oct 20 2012 *)
%o A014897 (Magma) I:=[1, 16, 227]; [n le 3 select I[n] else 16*Self(n-1) - 29*Self(n-2) + 14*Self(n-3): n in [1..20]]; // _Vincenzo Librandi_, Oct 20 2012
%Y A014897 Row n=14 of A126885.
%K A014897 nonn,easy
%O A014897 1,2
%A A014897 _N. J. A. Sloane_, _Olivier Gérard_