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

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

%S 0,1,11,128,1485,17231,199936,2319913,26918595,312343936,3624213461,

%T 42052755623,487949806080,5661817156241,65695637361211,

%U 762284731067008,8845001503265565,102631009653390271,1190856116710151936,13817834351385403193

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

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

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

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

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

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

%o (Magma) [n le 1 select n else 11*Self(n)+7*Self(n-1): n in [0..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 May 6 15:46 EDT 2024. Contains 372294 sequences. (Running on oeis4.)