|
|
A214712
|
|
a(n) is the least m > 0 such that Fibonacci(n)-m and n-m are relatively prime.
|
|
2
|
|
|
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, 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, 1, 2, 2, 5, 6, 1, 2, 1, 4, 1, 2, 2, 3, 2, 4, 1, 2, 1, 2
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
EXAMPLE
|
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.
|
|
MATHEMATICA
|
Table[m = 1; While[GCD[Fibonacci[n] - m, n - m] != 1, m++]; m, {n, 1, 140}]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|