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

%I #34 Dec 23 2023 14:28:12

%S 0,1,11,129,1507,17609,205755,2404177,28091987,328245273,3835433899,

%T 44815735073,523656556995,6118748007529,71495480538779,

%U 835400269986801,9761366814165043,114058237115709881,1332731542786129035,15572512867573098433

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

%H Vincenzo Librandi, <a href="/A015602/b015602.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,8).

%F G.f.: x/(1 - 11*x - 8*x^2). - _Zerinvary Lajos_, Apr 27 2009

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

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

%t CoefficientList[Series[(-x)/(8x^2+11x-1),{x,0,30}],x] (* _Harvey P. Dale_, Nov 01 2017 *)

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

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

%K nonn,easy

%O 0,3

%A _Olivier GĂ©rard_

%E G.f. adapted to the offset by _Vincenzo Librandi_, Nov 22 2012

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 03:33 EDT 2024. Contains 371767 sequences. (Running on oeis4.)