Abstract
Let z(N) be the order of appearance of N in the Fibonacci sequence. This is the smallest positive integer k such that N divides the k th Fibonacci number. We show that each of the six total possible orderings among z(N), z(N + 1), z(N + 2) appears infinitely often. We also show that for each nonzero even integer c and many odd integers c the equation z(N) = z(N + c) has infinitely many solutions N, but the set of solutions has asymptotic density zero. The proofs use a result of Corvaja and Zannier on the height of a rational function at 𝒮-unit points as well as sieve methods.