|
%I #30 Dec 23 2023 14:28:29
%S 0,1,11,127,1463,16855,194183,2237143,25773671,296933239,3420907655,
%T 39411583639,454052865959,5231051027383,60265878496967,
%U 694310969630935,7999015936922087,92155041123928567,1061699547984746759,12231625274575785751
%N a(n) = 11*a(n-1) + 6*a(n-2).
%H Vincenzo Librandi, <a href="/A015598/b015598.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,6).
%F G.f.: x/(1-11*x-6*x^2). [_Zerinvary Lajos_, Apr 27 2009]
%t Join[{a=0,b=1},Table[c=11*b+6*a;a=b;b=c,{n,60}]] (* _Vladimir Joseph Stephan Orlovsky_, Jan 31 2011 *)
%t LinearRecurrence[{11,6},{0,1},30] (* _Harvey P. Dale_, Oct 05 2012 *)
%o (Sage) [lucas_number1(n,11,-6) for n in range(0, 18)]# [_Zerinvary Lajos_, Apr 27 2009]
%o (Magma) [n le 2 select n-1 else 11*Self(n-1) + 6*Self(n-2): n in [1..30]]; // _Vincenzo Librandi_, Nov 22 2012
%K nonn,easy
%O 0,3
%A _Olivier Gérard_
|
