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!)
A014913 a(1)=1, a(n) = 24*a(n-1) + n. 2

%I #27 Feb 19 2024 01:53:00

%S 1,26,627,15052,361253,8670078,208081879,4993965104,119855162505,

%T 2876523900130,69036573603131,1656877766475156,39765066395403757,

%U 954361593489690182,22904678243752564383,549712277850061545208

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

%H Vincenzo Librandi, <a href="/A014913/b014913.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 (26, -49, 24).

%F a(1)=1, a(2)=26, a(3)=627, a(n) = 26*a(n-1) - 49*a(n-2) + 24*a(n-3). - _Vincenzo Librandi_, Oct 19 2012

%t LinearRecurrence[{26, -49, 24}, {1, 26, 627}, 20] (* _Vincenzo Librandi_, Oct 19 2012 *)

%o (Magma) I:=[1, 26, 627]; [n le 3 select I[n] else 26*Self(n-1) - 49*Self(n-2) + 24*Self(n-3): n in [1..20]]; // _Vincenzo Librandi_, Oct 19 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 19 08:39 EDT 2024. Contains 371782 sequences. (Running on oeis4.)