%I #6 Feb 17 2018 20:01:39
%S 1,1,1,3,4,2,6,7,3,9,7,4,12,13,5,10,16,6,18,19,7,21,17,8,24,16,9,27,
%T 28,10,19,31,11,33,34,12,27,37,13,39,25,14,42,32,15,28,46,16,48,49,17,
%U 51,52,18,54,34,19,42,49,20,37,61,21,63,47,22,66,67,23,58,43,24
%N a(n) is the least m > 0 such that Fibonacci(n-m) divides Fibonacci(n+1+m).
%H Clark Kimberling, <a href="/A214917/b214917.txt">Table of n, a(n) for n = 2..1000</a>
%e Write x#y if x|y is false; then 34#144, 21#233, 13|377 so a(10) = 3.
%t Table[m = 1; While[! Divisible[Fibonacci[n+1+m],Fibonacci[n-m]], m++]; m, {n, 2, 100}]
%Y Cf. A214738, A075861.
%K nonn,easy
%O 2,4
%A _Clark Kimberling_, Jul 30 2012