cp's OEIS Frontend

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.

Showing 1-1 of 1 results.

A065106 Smallest Fibonacci index to produce a factor p^2 (for primes p).

Original entry on oeis.org

6, 12, 25, 56, 91, 110, 153, 342, 406, 552, 703, 752, 820, 915, 930, 979
Offset: 1

Views

Author

Len Smiley, Nov 21 2001

Keywords

Comments

Following Lucas, these might be called the prime-squared ranks of apparition.
Assuming that there are no square primitive factors in the Fibonacci sequence (an open question), then this sequence continues 1431, 1892, 2147, 2701, 2943, 3029, 3422, 3852, 4378, 4556, 4753, 4970, 5050, 5513, 6162, 6394, 6972, 7550, 7868, 8841, 8862, 9453. This is obtained by sorting the sequence prime(n)*A001602(n). - T. D. Noe, Apr 15 2004

Examples

			342 is here but not in A065069 because Fib(342) is the first Fib divisible by 19^2, but 342 is divisible by 6 and so is not a primitive index.

Crossrefs

Cf. A065069, A037917, A065107.
Cf. A001602 (smallest m such that prime(n) divides Fibonacci(m)).
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.