0,1

Assuming that there are no square primitive factors in the Fibonacci sequence (an open question), then this sequence continues 53, 43, 113, 73, 109, 233, 59, 107, 199, 67, 97, 71, 101, 149, 79, 139, 83, 151, 281, 421, 211, 137, 103, 157, 307, 521. This is obtained by sorting the pairs (prime(n)*A001602(n), prime(n)) by the first position and noting the order of the primes in the second position. - T. D. Noe (noe(AT)sspectra.com), Apr 15 2004

Cf. A065069, A065106.

Cf. A001602 (smallest m such that prime(n) divides Fibonacci(m)).

Sequence in context: A126054 A067836 A108546 this_sequence A090420 A031344 A004682

Adjacent sequences: A065104 A065105 A065106 this_sequence A065108 A065109 A065110

nonn

Len Smiley (smiley(AT)math.uaa.alaska.edu), Nov 21 2001