A079346 Primes p such that F(p-(p/5)) is the first Fibonacci number that p divides.

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

Author

Jon Perry, Jan 04 2003

Keywords

• nonn

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)).

Examples

			7 belongs to this sequence since (7/5) = -1, F(8) = 21 and 7 does not divide F(1) to F(7).
		

Links

• Amiram Eldar, Table of n, a(n) for n = 1..10000

Crossrefs

Union of A000057, A106535 and {5}.

Cf. A001602, A079347, A079348, A079349.

Programs

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) ) ))

Extensions

Corrected and edited by Max Alekseyev, Nov 23 2007