A339943 Let N(p,i) denote the result of applying "nextprime" i times to p; a(n) = smallest prime p such that N(p,3) - p = 2*n, or -1 if no such prime exists.
-1, -1, -1, 3, 7, 17, 23, 43, 79, 107, 109, 113, 197, 199, 317, 509, 523, 773, 1823, 1237, 1319, 3119, 1321, 2473, 2153, 4159, 2477, 6491, 5581, 7351, 9551, 9973, 18803, 18593, 24247, 30559, 31883, 33211, 19603, 66191, 37699, 31393, 83117, 43801, 107351, 107357, 69499, 38461, 130859
Offset: 1
Keywords
Examples
a(4) = 3. This represents the beginning of the run of primes {3, 5, 7, 11}. (11 - 3)/2 = 4 and it is the first prime to do so. Others are 5, 11, 101, 191, etc.; a(5) = 7. This represents the beginning of the run of primes {7, 11, 13, 17}. (17 - 7)/2 = 5 and it is the first prime to do so. Others are 13, 37, 97, 103, etc.; a(6) = 17. This represents the beginning of the run of primes {17, 19, 23 & 29}. (29 - 17)/2 = 6 and it is the first prime to do so. Others are 19, 29, 31, 41, etc.
Links
- Martin Raab, Table of n, a(n) for n = 1..504 (Terms 1..345 from Robert G. Wilson v)
Programs
-
Mathematica
p = 3; q = 5; r = 7; s = 11; tt[_] := 0; While[p < 250000, d = (s - p)/2; If[ tt[d] == 0, tt[d] = p]; {p, q, r, s} = {q, r, s, NextPrime@ s}]; tt@# & /@ Range@ 75
Comments