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!)
 A015594 a(n) = 11*a(n-1) + 3*a(n-2). 1
 0, 1, 11, 124, 1397, 15739, 177320, 1997737, 22507067, 253570948, 2856801629, 32185530763, 362611243280, 4085280268369, 46025916681899, 518540924305996, 5842027917411653, 65817929864446171, 741523312261142840, 8354210224465909753 (list; graph; refs; listen; history; text; internal format)
 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,3). FORMULA a(n) = (1/133)*(11/2 + (1/2)*sqrt(133))^n*sqrt(133) - (1/133)*sqrt(133)*(11/2 - (1/2)*sqrt(133))^n. - Paolo P. Lava, Jul 09 2008 G.f.: x/(1 - 11*x - 3*x^2). - Zerinvary Lajos, Dec 20 2008 MAPLE a:=proc(n) option remember; if n=0 then 0 elif n=1 then 1 else 11*a(n-1)+3*a(n-2); fi; end: seq(a(n), n=0..30); # Wesley Ivan Hurt, Jan 24 2017 MATHEMATICA Join[{a=0, b=1}, Table[c=11*b+3*a; a=b; b=c, {n, 60}]] (* Vladimir Joseph Stephan Orlovsky, Jan 31 2011 *) LinearRecurrence[{11, 3}, {0, 1}, 30] (* Vincenzo Librandi, Nov 22 2012 *) PROG (Sage) [lucas_number1(n, 11, -3) for n in range(0, 18)] # Zerinvary Lajos, Apr 27 2009 (MAGMA) [n le 2 select n-1 else 11*Self(n-1) + 3*Self(n-2): n in [1..30]]; // Vincenzo Librandi, Nov 22 2012 CROSSREFS Sequence in context: A258843 A015593 A224816 * A209605 A282755 A242523 Adjacent sequences:  A015591 A015592 A015593 * A015595 A015596 A015597 KEYWORD nonn,easy AUTHOR EXTENSIONS Entries verified by Neven Juric (neven.juric(AT)apis-it.hr), Jan 28 2008 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 20 04:33 EDT 2020. Contains 337264 sequences. (Running on oeis4.)