The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A015597 a(n) = 11 a(n-1) + 5 a(n-2). 1

%I

%S 0,1,11,126,1441,16481,188496,2155861,24656951,282005766,3225348181,

%T 36888858821,421904187936,4825390361401,55188814915091,

%U 631203915873006,7219187149178521,82567078220328761,944333796169508976,10800507148966242541

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

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

%F a(n) = (1/141)*(11/2 + (1/2)*sqrt(141))^n*sqrt(141) - (1/141)*sqrt(141)*(11/2 - (1/2)*sqrt(141))^n. - _Paolo P. Lava_, Jul 09 2008

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

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

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

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

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

%K nonn,easy

%O 0,3