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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A015602 a(n) = 11 a(n-1) + 8 a(n-2). 0
0, 1, 11, 129, 1507, 17609, 205755, 2404177, 28091987, 328245273, 3835433899, 44815735073, 523656556995, 6118748007529, 71495480538779, 835400269986801, 9761366814165043, 114058237115709881 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

FORMULA

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

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

MATHEMATICA

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

PROG

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

CROSSREFS

Sequence in context: A015601 A024144 A201877 * A183837 A015603 A184280

Adjacent sequences:  A015599 A015600 A015601 * A015603 A015604 A015605

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 23:29 EST 2012. Contains 206085 sequences.