login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A014897 a(1)=1, a(n) = 14*a(n-1) + n. 3

%I #26 Feb 19 2024 01:51:50

%S 1,16,227,3182,44553,623748,8732479,122254714,1711566005,23961924080,

%T 335466937131,4696537119846,65751519677857,920521275490012,

%U 12887297856860183,180422169996042578,2525910379944596109,35362745319224345544,495078434469140837635

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

%H Vincenzo Librandi, <a href="/A014897/b014897.txt">Table of n, a(n) for n = 1..200</a>

%H <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (16, -29, 14).

%F 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

%t LinearRecurrence[{16, -29, 14}, {1, 16, 227}, 20] (* _Vincenzo Librandi_, Oct 20 2012 *)

%o (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

%K nonn

%O 1,2

%A _N. J. A. Sloane_, _Olivier GĂ©rard_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 11:52 EDT 2024. Contains 371779 sequences. (Running on oeis4.)