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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A140781 a(n) = 10*a(n-1) - a(n-2). 0
1, 2, 19, 188, 1861, 18422, 182359, 1805168, 17869321, 176888042, 1751011099, 17333222948, 171581218381 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

A140780 has the same recursion rule but starts (1, 3, 29,...).

a(n)/a(n-1) tends to 2*sqrt(6) + 5 = 9.8989794855...

FORMULA

a(n) = 10*a(n-1) - a(n-2); n>1; given a(0) = 1, a(1) = 2. a(n) = term (1,1) in X^n, where X = the 2x2 matrix [2,3; 5,8].

a(n) = (-1/8)*[5+2*sqrt(6)]^n*sqrt(6)+(1/8)*sqrt(6)*[5-2*sqrt(6)]^n+(1/2)*[5+2*sqrt(6)]^n+(1/2) *[5-2*sqrt(6)]^n, with n>=0 - Paolo P. Lava (paoloplava(AT)gmail.com), Jun 06 2008

EXAMPLE

a(5) = 18422 = 10*a(4) - a(3) = 10*1861 - 188.

a(3) = 188 = term (1,1) of X^3.

CROSSREFS

Cf. A140780.

Sequence in context: A037637 A163067 A124262 * A128970 A145104 A114016

Adjacent sequences:  A140778 A140779 A140780 * A140782 A140783 A140784

KEYWORD

nonn

AUTHOR

Gary W. Adamson (qntmpkt(AT)yahoo.com), May 30 2008

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 03:33 EST 2012. Contains 205694 sequences.