OFFSET
0,2
COMMENTS
Conjecture: The sequence is infinite.
Based on a table of the first 300 Fibonacci numbers, factorized.
Number of prime divisors counted with multiplicity. - Harvey P. Dale, Mar 06 2024
LINKS
Amiram Eldar, Table of n, a(n) for n = 0..24
FORMULA
EXAMPLE
a(5) = 701408733 = 3 * 43 * 89 * 199 * 307.
MAPLE
From R. J. Mathar, Oct 14 2010: (Start)
A001221 := proc(n) nops(numtheory[factorset](n)) ; end proc:
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:
for n from 1 do printf("%d, \n", A095224(n)) ; end do: (End)
MATHEMATICA
Table[SelectFirst[{#, PrimeOmega[#]}&/@Select[Fibonacci[Range[200]], SquareFreeQ], #[[2]] == n&], {n, 0, 11}][[;; , 1]] (* Harvey P. Dale, Mar 06 2024 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Amarnath Murthy, Jun 10 2004
EXTENSIONS
a(9) corrected and 3 terms added by R. J. Mathar, Oct 14 2010
STATUS
approved