Is there a proven way to calculate the entry point(first occurence) of a factor m, in the Fibonacci sequence?

Question

I saw a comment at the OEIS website for the sequence of entry points of Fibonacci factors. It referenced a paper by Mark Renault in 1996, with the quote from OEIS: http://webspace.ship.edu/msrenault/fibonacci/FibThesis.pdf

If m has prime factorization m=p₁^e₁ * p₂^e₂ * ... * p_n^e_n then a_m=lcm(a_p1^e1, a_p2^e2, ..., a_pn^en).

Is this result accepted to be true?