Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A015453
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A015453 Generalized Fibonacci numbers. +0
3
1, 1, 8, 57, 407, 2906, 20749, 148149, 1057792, 7552693, 53926643, 385039194, 2749201001, 19629446201, 140155324408, 1000716717057, 7145172343807, 51016923123706, 364263634209749, 2600862362591949, 18570300172353392 (list; graph; listen)
OFFSET

0,3

LINKS

Tanya Khovanova, Recursive Sequences

FORMULA

a(n) = 7 a(n-1) + a(n-2).

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

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

CROSSREFS

Adjacent sequences: A015450 A015451 A015452 this_sequence A015454 A015455 A015456

Sequence in context: A023000 A097114 A022038 this_sequence A002402 A015464 A026948

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

Last modified October 11 13:47 EDT 2008. Contains 144830 sequences.


AT&T Labs Research