This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A277213 #14 Jan 31 2025 18:56:06
%S A277213 3,7,17,23,29,47,167,419,83
%N A277213 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 A277213 Least k such that A001221(Fibonacci(k+1)) / A001221(Fibonacci(k)) = n, or 0 if no such k exists.
%e A277213 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.
%t A277213 Flatten[Table[Position[Partition[PrimeNu[Fibonacci[Range[2,420]]],2,1],_?(k #[[1]]==#[[2]]&),1,1,Heads->False],{k,9}]]+1 (* _Harvey P. Dale_, Jan 31 2025 *)
%Y A277213 Cf. A000045, A001221, A022307, A277207.
%K A277213 nonn,more
%O A277213 1,1
%A A277213 _Altug Alkan_, Oct 05 2016
%E A277213 a(8)-a(9) from _Charles R Greathouse IV_, Oct 05 2016