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!)
A015596 a(n) = 11 a(n-1) + 4 a(n-2). 1

%I #33 Dec 23 2023 14:28:41

%S 0,1,11,125,1419,16109,182875,2076061,23568171,267554125,3037368059,

%T 34481265149,391443388875,4443802338221,50447599275931,

%U 572698801388125,6501477212373099,73807044541656589,837883398807714875,9511945565051489981

%N a(n) = 11 a(n-1) + 4 a(n-2).

%H Vincenzo Librandi, <a href="/A015596/b015596.txt">Table of n, a(n) for n = 0..900</a>

%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (11,4).

%F G.f.: x/(1-11*x-4*x^2). [_Zerinvary Lajos_, Dec 20 2008]

%t Join[{a=0,b=1},Table[c=11*b+4*a;a=b;b=c,{n,60}]] (* _Vladimir Joseph Stephan Orlovsky_, Jan 31 2011 *)

%t LinearRecurrence[{11, 4}, {0, 1}, 30] (* _Vincenzo Librandi_, Nov 22 2012 *)

%o (Sage) [lucas_number1(n,11,-4) for n in range(0, 18)]# [_Zerinvary Lajos_, Apr 27 2009]

%o (Magma) [n le 2 select n-1 else 11*Self(n-1) + 4*Self(n-2): n in [1..30]]; // _Vincenzo Librandi_, Nov 22 2012

%K nonn,easy

%O 0,3

%A _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 16 12:52 EDT 2024. Contains 371711 sequences. (Running on oeis4.)