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!)
 A214065 a(n) is the least m > 0 such that Fibonacci(n+1+m) and n-m are not relatively prime. 2
 1, 2, 3, 4, 2, 2, 1, 6, 5, 1, 3, 2, 1, 5, 4, 4, 2, 2, 1, 6, 5, 1, 3, 2, 1, 5, 2, 4, 2, 2, 1, 2, 5, 1, 3, 2, 1, 5, 5, 1, 2, 2, 1, 6, 5, 1, 2, 2, 1, 5, 5, 1, 2, 2, 1, 6, 2, 1, 3, 2, 1, 2, 5, 4, 2, 2, 1, 6, 5, 1, 3, 2, 1, 5, 5, 4, 2, 1, 1, 6, 5, 1, 3, 2, 1, 5, 2, 4, 2, 2, 1, 2, 2, 1, 3, 2, 1, 5, 5 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Clark Kimberling, Table of n, a(n) for n = 1..1000 EXAMPLE gcd(F(5+1+1), 5-1) = 1 and gcd(F(5+1+2), 5-2) > 1, so that a(5) = 2. MATHEMATICA b[n_] := Fibonacci[n]; c[n_] := n; Table[m = 1; While[GCD[b[n + 1 + m], c[n] - m] == 1, m++]; m, {n, 1, 120}] CROSSREFS Cf. A214063, A214064. Sequence in context: A114734 A299755 A323907 * A182710 A182711 A138136 Adjacent sequences:  A214062 A214063 A214064 * A214066 A214067 A214068 KEYWORD nonn,easy AUTHOR Clark Kimberling, Jul 25 2012 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 May 26 00:08 EDT 2020. Contains 334613 sequences. (Running on oeis4.)