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 A095224 #14 Mar 06 2024 11:08:17
%S A095224 1,2,21,610,6765,701408733,102334155,190392490709135,
%T A095224 251728825683549488150424261,23416728348467685,
%U A095224 13598018856492162040239554477268290,81055900096023504197206408605
%N A095224 Least squarefree Fibonacci number with exactly n prime divisors.
%C A095224 Conjecture: The sequence is infinite.
%C A095224 Based on a table of the first 300 Fibonacci numbers, factorized.
%C A095224 Number of prime divisors counted with multiplicity. - _Harvey P. Dale_, Mar 06 2024
%H A095224 Amiram Eldar, <a href="/A095224/b095224.txt">Table of n, a(n) for n = 0..24</a>
%F A095224 min{A000045(i): A038575(i) = A022307(i) = n}. a(n) >= A060319(n). - _R. J. Mathar_, Oct 14 2010
%e A095224 a(5) = 701408733 = 3 * 43 * 89 * 199 * 307.
%p A095224 From _R. J. Mathar_, Oct 14 2010: (Start)
%p A095224 A001221 := proc(n) nops(numtheory[factorset](n)) ; end proc:
%p A095224 A095224 := proc(n) for i from 1 do f := combinat[fibonacci](i) ; if A001221(f) =n and numtheory[bigomega](f) = n then return f ; fi; od ; end proc:
%p A095224 for n from 1 do printf("%d,\n",A095224(n)) ; end do: (End)
%t A095224 Table[SelectFirst[{#,PrimeOmega[#]}&/@Select[Fibonacci[Range[200]],SquareFreeQ],#[[2]] == n&],{n,0,11}][[;;,1]] (* _Harvey P. Dale_, Mar 06 2024 *)
%Y A095224 Cf. A022307, A038575. - _R. J. Mathar_, Oct 14 2010
%K A095224 nonn
%O A095224 0,2
%A A095224 _Amarnath Murthy_, Jun 10 2004
%E A095224 a(9) corrected and 3 terms added by _R. J. Mathar_, Oct 14 2010