A214063 - OEIS

%I #9 Feb 17 2018 20:00:58

%S 1,2,3,4,1,2,1,8,9,5,1,2,1,14,5,16,1,2,1,5,10,1,1,2,1,2,2,28,1,2,1,10,

%T 33,6,1,2,1,38,4,5,1,2,1,44,5,1,1,2,1,2,1,21,1,2,1,7,1,58,1,2,1,62,3,

%U 64,1,2,1,68,69,1,1,2,1,2,5,76,1,1,1,5,40,82,1,2,1,28,2,10,1,2

%N a(n) is the least m > 0 such that Fibonacci(n)+m and n-m are not relatively prime.

%H Clark Kimberling, <a href="/A214063/b214063.txt">Table of n, a(n) for n = 1..1000</a>

%e gcd(8+1, 6-1) = 1 and gcd(8+2, 6-2) = 2, so that a(6) = 2.

%t b[n_] := Fibonacci[n]; c[n_] := n;

%t Table[m = 1; While[GCD[b[n] + m, c[n] - m] == 1, m++]; m, {n, 1, 150}]

%Y Cf. A214064, A214065.

%K nonn,easy

%O 1,2

%A _Clark Kimberling_, Jul 25 2012