login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A079346
Primes p such that F(p-(p/5)) is the first Fibonacci number that p divides.
5
2, 3, 5, 7, 11, 19, 23, 31, 43, 59, 67, 71, 79, 83, 103, 127, 131, 163, 167, 179, 191, 223, 227, 239, 251, 271, 283, 311, 359, 367, 379, 383, 419, 431, 439, 443, 463, 467, 479, 487, 491, 499, 503, 523, 547, 571, 587, 599, 607, 631, 643, 647, 659, 683, 719, 727, 739, 751, 787, 823, 827
OFFSET
1,1
COMMENTS
The n-th prime p is in this sequence iff A001602(n) = p-(5/p) (that is the maximum possible value of A001602(n)).
LINKS
EXAMPLE
7 belongs to this sequence since (7/5) = -1, F(8) = 21 and 7 does not divide F(1) to F(7).
PROG
(PARI) forprime (p=2, 500, wss=p-kronecker(5, p); for(n=1, wss, if( fibonacci(n)%p==0, if( n==wss, print1(p", "), break) ) ))
CROSSREFS
Union of A000057, A106535 and {5}.
Sequence in context: A039986 A278694 A214837 * A228062 A332216 A059878
KEYWORD
nonn
AUTHOR
Jon Perry, Jan 04 2003
EXTENSIONS
Corrected and edited by Max Alekseyev, Nov 23 2007
STATUS
approved