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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A015606 a(n) = 11 a(n-1) + 10 a(n-2). 0
0, 1, 11, 131, 1551, 18371, 217591, 2577211, 30525231, 361549651, 4282298471, 50720779691, 600751561311, 7115474971331, 84277740297751, 998209892988571, 11823086225851791, 140036047414255411 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

FORMULA

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

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

MATHEMATICA

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

PROG

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

CROSSREFS

Sequence in context: A185127 A076255 A076357 * A077417 A082148 A075509

Adjacent sequences:  A015603 A015604 A015605 * A015607 A015608 A015609

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 15 07:42 EST 2012. Contains 205717 sequences.