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!)
 A121891 Least m such that (F(n) mod m) > (F(n+2) mod m). 0
 3, 4, 2, 3, 3, 2, 5, 4, 2, 5, 5, 2, 3, 4, 2, 5, 3, 2, 7, 3, 2, 5, 10, 2, 3, 4, 2, 3, 3, 2, 5, 4, 2, 11, 7, 2, 3, 4, 2, 7, 3, 2, 13, 3, 2, 11, 5, 2, 3, 4, 2, 3, 3, 2, 6, 4, 2, 7, 19, 2, 3, 4, 2, 10, 3, 2, 5, 3, 2, 5, 5, 2, 3, 4, 2, 3, 3, 2, 6, 4, 2, 5, 7, 2, 3, 4, 2, 7, 3, 2, 5, 3, 2, 11, 13, 2, 3, 4, 2, 3, 3 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS F(n) = Fibonacci numbers A000045. LINKS EXAMPLE n=20: a(20) = 7 because F(20)=6765 == 3 mod 7, F(22)=17711 == 1 mod 7 and 7 is the least m such that 6765 > 17711 mod m. MATHEMATICA s={}; Do[n1=Fibonacci [n]; n2=Fibonacci [n+2]; Do[If[Mod[n1, m]>Mod[n2, m], AppendTo[s, {n, n1, n2, m}]; Break[]], {m, 1, 200}], {n, 2, 120}]; Last/@s CROSSREFS Cf. A000045. Sequence in context: A088916 A117966 A303932 * A271590 A232115 A275529 Adjacent sequences:  A121888 A121889 A121890 * A121892 A121893 A121894 KEYWORD nonn AUTHOR Zak Seidov, Aug 31 2006 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 2 14:21 EDT 2020. Contains 334787 sequences. (Running on oeis4.)