This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A065107 #11 Mar 30 2016 02:30:06 %S A065107 2,3,5,7,13,11,17,19,29,23,37,47,41,61,31,89 %N 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. %C A065107 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 %Y A065107 Cf. A065069, A065106. %Y A065107 Cf. A001602 (smallest m such that prime(n) divides Fibonacci(m)). %K A065107 nonn,more %O A065107 1,1 %A A065107 _Len Smiley_, Nov 21 2001