|
%I #12 Oct 08 2016 17:08:18
%S 3,7,17,23,29,47,167,419,83
%N Least k such that Fibonacci(k + 1) has n times as many distinct prime factors as Fibonacci(k), or 0 if no such k exists.
%C Least k such that A001221(Fibonacci(k+1)) / A001221(Fibonacci(k)) = n, or 0 if no such k exists.
%e a(2) = 7 because Fibonacci(8) = 21 = 3*7 (2 distinct prime factors) and Fibonacci(7) = 13 (1 prime factor), and 2/1 is 2.
%Y Cf. A000045, A001221, A022307, A277207.
%K nonn,more
%O 1,1
%A _Altug Alkan_, Oct 05 2016
%E a(8)-a(9) from _Charles R Greathouse IV_, Oct 05 2016
|
