|
%I #38 Dec 23 2023 14:27:49
%S 0,1,11,131,1551,18371,217591,2577211,30525231,361549651,4282298471,
%T 50720779691,600751561311,7115474971331,84277740297751,
%U 998209892988571,11823086225851791,140036047414255411,1658627383815327431,19645261696111155851
%N a(n) = 11*a(n-1) + 10*a(n-2).
%H Vincenzo Librandi, <a href="/A015606/b015606.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,10).
%F G.f.: x/(1 - 11*x - 10*x^2). - _Zerinvary Lajos_, Apr 27 2009
%F a(n) = 11*a(n-1) + 10*a(n-2), with a(0)=0, a(1)=1. - _Harvey P. Dale_, Feb 02 2015
%t Join[{a=0,b=1},Table[c=11*b+10*a;a=b;b=c,{n,60}]] (* _Vladimir Joseph Stephan Orlovsky_, Jan 31 2011 *)
%t LinearRecurrence[{11, 10}, {0, 1}, 30] (* _Vincenzo Librandi_, Nov 21 2012 *)
%o (Sage) [lucas_number1(n,11,-10) for n in range(0, 18)] # _Zerinvary Lajos_, Apr 27 2009
%o (Magma) [n le 2 select n-1 else 11*Self(n-1) + 10*Self(n-2): n in [1..22]]; // _Vincenzo Librandi_, Nov 21 2012
%K nonn,easy
%O 0,3
%A _Olivier Gérard_
%E G.f. adapted to the offset by _Vincenzo Librandi_, Nov 22 2012
|
