Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #6 Feb 17 2018 20:02:00
%S 1,1,2,1,2,3,4,3,2,7,4,9,6,3,8,13,6,15,4,7,11,19,8,5,13,9,12,25,6,27,
%T 16,11,17,7,12,33,19,13,8,37,14,39,22,9,23,43,16,21,10,17,26,49,18,11,
%U 24,19,29,55,12,57,31,21,32,13,22,63,34,23,14,67,24,69,37,15
%N a(n) is the least m > 0 such that Fibonacci(n-m) divides Fibonacci(2n+2m).
%H Clark Kimberling, <a href="/A214962/b214962.txt">Table of n, a(n) for n = 2..1000</a>
%e Write x#y if x|y is false; then 8#987, 5#2584, 3|6765 so a(7) = 3.
%t Table[m = 1; While[! Divisible[Fibonacci[2n+2m], Fibonacci[n - m]], m++]; m, {n, 2, 100}]
%Y Cf. A214917.
%K nonn,easy
%O 2,3
%A _Clark Kimberling_, Jul 31 2012