This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A065107 Start of the permutation of the primes in the order in which p^2 first appears as a factor of a number in the Fibonacci sequence. 1
 2, 3, 5, 7, 13, 11, 17, 19, 29, 23, 37, 47, 41, 61, 31, 89 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS 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, Apr 15 2004 LINKS CROSSREFS Cf. A065069, A065106. Cf. A001602 (smallest m such that prime(n) divides Fibonacci(m)). Sequence in context: A126054 A067836 A108546 * A185956 A316885 A225039 Adjacent sequences:  A065104 A065105 A065106 * A065108 A065109 A065110 KEYWORD nonn,more AUTHOR Len Smiley, Nov 21 2001 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 15 00:14 EDT 2019. Contains 328025 sequences. (Running on oeis4.)