Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A089125
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A089125 a(n+2)= a(n+1) + F(n+1)*a(n) where F(n) = Fibonacci number (A000045), a(0) = a(1) = 1. +0
1
1, 1, 2, 3, 7, 16, 51, 179, 842, 4601, 33229, 286284, 3243665, 44468561, 800242506, 17564890003, 505712818663, 17842259251624, 825465630656435, 46929863536852851, 3498201665311407586, 320978728492120944601 (list; graph; listen)
OFFSET

0,3

MATHEMATICA

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

CROSSREFS

Sequence in context: A162092 A143884 A122031 this_sequence A002854 A036356 A034732

Adjacent sequences: A089122 A089123 A089124 this_sequence A089126 A089127 A089128

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 November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research