Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A015451
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A015451 a(n) = 6 a(n-1) + a(n-2). +0
3
1, 1, 7, 43, 265, 1633, 10063, 62011, 382129, 2354785, 14510839, 89419819, 551029753, 3395598337, 20924619775, 128943316987, 794584521697, 4896450447169, 30173287204711, 185936173675435, 1145790329257321 (list; graph; listen)
OFFSET

0,3

COMMENT

a(n) = term (1,1) in the 2x2 matrix [1,2; 3,5]^n. - Gary W. Adamson (qntmpkt(AT)yahoo.com), May 30 2008

a(n)/a(n-1) tends to sqrt(10 + 3 = 6.16227766... - Gary W. Adamson (qntmpkt(AT)yahoo.com), May 30 2008

LINKS

Tanya Khovanova, Recursive Sequences

FORMULA

a(n)=Sum_{k, 0<=k<=n}5^k*A055830(n,k) . - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Oct 18 2006

a(n)=(1/10)*[3-sqrt(10)]^n*sqrt(10)-(1/10)*[3+sqrt(10)]^n*sqrt(10)+(1/2)*[3+sqrt(10)]^n+(1/2) *[3-sqrt(10)]^n, with n>=0 - Paolo P. Lava (ppl(AT)spl.at), Jun 25 2008

G.f.: (1-5*x)/(1-6*x-x^2). [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Nov 20 2008]

MAPLE

a[0]:=1: a[1]:=1: for n from 2 to 26 do a[n]:=6*a[n-1]+a[n-2] od: seq(a[n], n=0..20); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jul 26 2006

CROSSREFS

Sequence in context: A161728 A003464 A022036 this_sequence A126502 A042213 A164775

Adjacent sequences: A015448 A015449 A015450 this_sequence A015452 A015453 A015454

KEYWORD

nonn,easy

AUTHOR

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

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 | The OEIS Foundation | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified March 20 09:10 EDT 2010. Contains 173642 sequences.


AT&T Labs Research