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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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, 2, 4, 14, 62, 422, 4182, 63228, 1469976, 53456724, 3070947684, 281012112132, 41181274957380, 9701178631343304, 3682464921740427408, 2255878665570796559928, 2232433139398395667219512 (list; graph; refs; listen; history; internal format)
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 * A132852 A132079 A055790

Adjacent sequences:  A089124 A089125 A089126 * A089128 A089129 A089130

KEYWORD

nonn

AUTHOR

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

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 14 17:56 EST 2012. Contains 205654 sequences.