Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A089127
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A089127 a(n+2) = F(n)*a(n+1) + F(n+1)*a(n) where F(n) = Fibonacci number (A000045) and a(0) = a(1) = 1. +0
1
1, 1, 1, 2, 4, 14, 62, 422, 4182, 63228, 1469976, 53456724, 3070947684, 281012112132, 41181274957380, 9701178631343304, 3682464921740427408, 2255878665570796559928, 2232433139398395667219512 (list; graph; listen)
OFFSET

0,4

FORMULA

Recurrence; a(n+2) = F(n) a(n+1) + F(n+1) a(n) where F(n) = Fibonacci number (A000045)

MATHEMATICA

a[n_] := a[n] = Fibonacci[n - 2]a[n - 1] + Fibonacci[n - 1]a[n - 2] a[0] = 1 a[1] = 1

CROSSREFS

Sequence in context: A132880 A019537 A046911 this_sequence A132852 A055790 A020131

Adjacent sequences: A089124 A089125 A089126 this_sequence A089128 A089129 A089130

KEYWORD

nonn

AUTHOR

Emanuele Munarini (munarini(AT)mate.polimi.it), Dec 05 2003

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 July 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research