Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A124610
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A124610 a(n) = 5*a(n-1) + 2*a(n-2), n>1; a(0) = a(1) = 1. +0
2
1, 1, 7, 37, 199, 1069, 5743, 30853, 165751, 890461, 4783807, 25699957, 138067399, 741736909, 3984819343, 21407570533, 115007491351, 617852597821, 3319277971807, 17832095054677, 95799031216999, 514659346194349 (list; graph; listen)
OFFSET

0,3

COMMENT

Top left element of powers of the matrix [1,2;3,4].

FORMULA

a(n)/a(n-1) tends to (sqrt(33) + 5)/2 = 5.37228132... - Gary W. Adamson (qntmpkt(AT)yahoo.com), Mar 03 2008

a(n)=-(1/22)*sqrt(33)*[5/2+(1/2)*sqrt(33)]^n+(1/2)*[5/2-(1/2)*sqrt(33)]^n+(1/22)*[5/2-(1/2) *sqrt(33)]^n*sqrt(33)+(1/2)*[5/2+(1/2)*sqrt(33)]^n, with n>=0 - Paolo P. Lava (ppl(AT)spl.at), Jul 07 2008

EXAMPLE

a(5) = 1069 because [1,2;3,4]^5 = [1069,1558;2337,3406]

MATHEMATICA

Table[MatrixPower[{{1, 2}, {3, 4}}, n][[1]][[1]], {n, 0, 30}]

CROSSREFS

Cf. A100638.

Sequence in context: A069378 A117130 A002807 this_sequence A002683 A126475 A077239

Adjacent sequences: A124607 A124608 A124609 this_sequence A124611 A124612 A124613

KEYWORD

easy,nonn

AUTHOR

Fredrik Johansson (fredrik.johansson(AT)gmail.com), Dec 20 2006

EXTENSIONS

Recurrence from Gary W. Adamson (qntmpkt(AT)yahoo.com), Mar 03 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research