A064652 Primes q associated with A064632.

2, 3, 2, 3, 2, 5, 3, 3, 2, 3, 2, 5, 3, 3, 2, 7, 2, 11, 3, 3, 2, 3, 5, 5, 3, 5, 2, 3, 2, 11, 7, 3, 5, 3, 2, 5, 7, 3, 2, 3, 2, 5, 3, 5, 2, 7, 3, 5, 3, 3, 2, 3, 3, 7, 3, 5, 2, 13, 2, 7, 7, 3, 5, 3, 2, 5, 3, 3, 2, 13, 2, 5, 3, 3, 7, 7, 2, 5, 43, 3, 2, 3, 5, 13, 3, 5, 2, 3, 3, 7, 19, 5, 11, 3, 2, 5, 3, 3, 2

Offset: 2

Author

Robert G. Wilson v, Oct 16 2001

Keywords

• easy
• nonn

Examples

			a(7) = 5 because (29-1)/(5-1).
		

Links

• Daria Micovic, Table of n, a(n) for n = 2..10000 [Terms 2-100 were computed by Robert G. Wilson v; terms 101-1155 were computed by Stephanie Anderson; terms 1156-10000 were computed by Daria Micovic]
• Matthew M. Conroy, Journal of Integer Sequences, A sequence related to a conjecture of Schinzel

Crossrefs

Cf. A064632, A064673.

Programs

Mathematica

NextPrim[n_] := (k = n + 1; While[ !PrimeQ[k], k++ ]; k); Do[p = 2; While[q = (p - 1)/n + 1; !PrimeQ[q] || q >= p, p = NextPrim[p]]; Print[q], {n, 2, 100} ]