# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/ Search: id:a214712 Showing 1-1 of 1 %I A214712 #9 Feb 17 2018 20:01:22 %S A214712 2,1,1,1,4,1,2,1,1,2,4,5,4,1,2,1,4,1,2,2,3,2,2,1,2,1,2,1,6,3,6,2,1,2, %T A214712 4,1,4,1,1,2,2,3,4,1,1,1,2,1,2,2,1,2,4,1,2,1,1,2,4,7,4,4,1,1,2,1,2,1, %U A214712 1,2,2,5,6,1,2,1,4,1,2,2,3,2,4,1,2,1,2 %N A214712 a(n) is the least m > 0 such that Fibonacci(n)-m and n-m are relatively prime. %H A214712 Clark Kimberling, Table of n, a(n) for n = 1..1000 %e A214712 gcd(89-1,11-1) = 2, gcd(89-2,11-2) = 3, gcd(89-3,11-3) = 2, gcd(89-4,11-4) = 1, so a(11) = 4. %t A214712 Table[m = 1; While[GCD[Fibonacci[n] - m, n - m] != 1, m++]; m, {n, 1, 140}] %Y A214712 Cf. A214713. %K A214712 nonn,easy %O A214712 1,1 %A A214712 _Clark Kimberling_, Jul 27 2012 # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE