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

%I #29 Feb 19 2024 01:52:50

%S 1,24,531,11686,257097,5656140,124435087,2737571922,60226582293,

%T 1324984810456,29149665830043,641292648260958,14108438261741089,

%U 310385641758303972,6828484118682687399,150226650611019122794

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

%H Vincenzo Librandi, <a href="/A014907/b014907.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 (24, -45, 22).

%F a(1)=1, a(2)=24, a(3)=531, a(n) = 24*a(n-1) - 45*a(n-2) + 22*a(n-3). - _Vincenzo Librandi_, Oct 19 2012

%t LinearRecurrence[{24, -45, 22}, {1, 24, 531}, 20] (* _Vincenzo Librandi_, Oct 19 2012 *)

%o (Magma) I:=[1, 24, 531]; [n le 3 select I[n] else 24*Self(n-1) - 45*Self(n-2) + 22*Self(n-3): n in [1..20]]; // _Vincenzo Librandi_, Oct 19 2012

%o (Maxima)

%o a[1]:1$

%o a[2]:24$

%o a[3]:531$

%o a[n]:=24*a[n-1]-45*a[n-2]+22*a[n-3]$

%o A014907(n):=a[n]$

%o makelist(A014907(n),n,1,30); /* _Martin Ettl_, Nov 06 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 17:49 EDT 2024. Contains 371797 sequences. (Running on oeis4.)