login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A015603 a(n) = 11 a(n-1) + 9 a(n-2). 0
0, 1, 11, 130, 1529, 17989, 211640, 2489941, 29294111, 344644690, 4054738589, 47703926689, 561235840880, 6602929589881, 77683348056611, 913943194931650, 10752525276757649, 126503266798718989 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

FORMULA

a(n)=-(1/157)*sqrt(157)*[11/2-(1/2)*sqrt(157)]^n+(1/157)*sqrt(157)*[11/2+(1/2)*sqrt(157)]^n, with n>=0 - Paolo P. Lava (paoloplava(AT)gmail.com), Jul 09 2008

G.f.:1/(1-11*x-9*x^2) . [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 27 2009]

MATHEMATICA

Join[{a=0, b=1}, Table[c=11*b+9*a; a=b; b=c, {n, 60}]] (*From Vladimir Joseph Stephan Orlovsky, Jan 31 2011*)

PROG

(Other) sage: [lucas_number1(n, 11, -9) for n in xrange(0, 18)]# [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 27 2009]

CROSSREFS

Sequence in context: A201877 A015602 A183837 * A184280 A157718 A046210

Adjacent sequences:  A015600 A015601 A015602 * A015604 A015605 A015606

KEYWORD

nonn,easy

AUTHOR

Olivier Gerard (olivier.gerard(AT)gmail.com)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 09:04 EST 2012. Contains 205998 sequences.