login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A064652 Primes q associated with A064632. 3

%I

%S 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,

%T 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,

%U 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

%N Primes q associated with A064632.

%H Daria Micovic, <a href="/A064652/b064652.txt">Table of n, a(n) for n = 2..10000</a> [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]

%H Matthew M. Conroy, Journal of Integer Sequences, <a href="http://www.cs.uwaterloo.ca/journals/JIS/VOL4/CONROY/conroy.html">A sequence related to a conjecture of Schinzel</a>

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

%t 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} ]

%Y Cf. A064632, A064673.

%K easy,nonn

%O 2,1

%A _Robert G. Wilson v_, Oct 16 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 28 09:09 EDT 2022. Contains 354112 sequences. (Running on oeis4.)