The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A097594 a(0) = 3, a(1) = 2, a(n) = Mod[a(n-1),a(n-2)] + a(n-2) for n > 1. 1
 2, 5, 3, 8, 5, 13, 8, 21, 13, 34, 21, 55, 34, 89, 55, 144, 89, 233, 144, 377, 233, 610, 377, 987, 610, 1597, 987, 2584, 1597, 4181, 2584, 6765, 4181, 10946, 6765, 17711, 10946, 28657, 17711, 46368 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS a(2n) = F(n+4), a(2n+1) = F(n+3) = A000045(n+3) where F(m) is the m-th Fibonacci number. a(n) = A053602(n+5) = A051792(n+11) LINKS CROSSREFS Cf. A000045, A053602, A051792. Sequence in context: A169856 A185112 A063955 * A204980 A300896 A191732 Adjacent sequences:  A097591 A097592 A097593 * A097595 A097596 A097597 KEYWORD nonn AUTHOR Gerald McGarvey, Aug 29 2004 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 21 19:59 EDT 2021. Contains 345365 sequences. (Running on oeis4.)