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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A089126 a(n+2) = F(n+1)*a(n+1) + F(n)*a(n) where F(n) = Fibonacci number (A000045), a(0) = a(1) = 1. 1
1, 1, 1, 2, 5, 19, 110, 975, 13555, 297330, 10393875, 581772345, 52349401830, 7590091602225, 1776029657181945, 671331672100911690, 410181883162313724165, 405259031001185201881755 (list; graph; refs; listen; history; internal format)
OFFSET

0,4

FORMULA

Floor(a(n)/a(n-1)) = F(n-1) where F(n) = Fibonacci number - Gerald McGarvey (Gerald.McGarvey(AT)comcast.net), Jul 17 2004

MATHEMATICA

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

CROSSREFS

Sequence in context: A009311 A107882 A192445 * A113346 A198945 A054926

Adjacent sequences:  A089123 A089124 A089125 * A089127 A089128 A089129

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 16 11:30 EST 2012. Contains 205907 sequences.