A015606 a(n) = 11*a(n-1) + 10*a(n-2).

0, 1, 11, 131, 1551, 18371, 217591, 2577211, 30525231, 361549651, 4282298471, 50720779691, 600751561311, 7115474971331, 84277740297751, 998209892988571, 11823086225851791, 140036047414255411, 1658627383815327431, 19645261696111155851

Offset

0,3

Links

Vincenzo Librandi, Table of n, a(n) for n = 0..900

Index entries for linear recurrences with constant coefficients, signature (11,10).

Formula

G.f.: x/(1 - 11*x - 10*x^2). - Zerinvary Lajos, Apr 27 2009

a(n) = 11*a(n-1) + 10*a(n-2), with a(0)=0, a(1)=1. - Harvey P. Dale, Feb 02 2015

Mathematica

Join[{a=0, b=1}, Table[c=11*b+10*a; a=b; b=c, {n, 60}]] (* Vladimir Joseph Stephan Orlovsky, Jan 31 2011 *)
LinearRecurrence[{11, 10}, {0, 1}, 30] (* Vincenzo Librandi, Nov 21 2012 *)

Prog

(Sage) [lucas_number1(n, 11, -10) for n in range(0, 18)] # Zerinvary Lajos, Apr 27 2009
(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

Crossrefs

Sequence in context: A302759 A076255 A076357 * A077417 A082148 A075509

Adjacent sequences: A015603 A015604 A015605 * A015607 A015608 A015609

Keyword

nonn,easy

Author

Olivier Gérard

Extensions

G.f. adapted to the offset by Vincenzo Librandi, Nov 22 2012

Status

approved