|
|
A162417
|
|
Find max {primes such that p < n^2, n = 2,3,...}, then the gap g(n) between that prime and its successor. This sequence is the sequence of differences {2n - g(n)}.
|
|
1
|
|
|
2, 2, 4, 4, 6, 8, 10, 14, 16, 8, 14, 20, 24, 26, 26, 24, 22, 30, 36, 38, 36, 28, 42, 38, 48, 48, 42, 44, 40, 48, 54, 62, 58, 64, 66, 68, 68, 66, 76, 58, 66, 72, 72, 80, 76, 88, 84, 86, 74, 86, 96, 90, 100, 96, 96, 92, 106, 96, 106, 114, 110, 104, 122, 120, 124, 124, 120, 114
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
2,1
|
|
COMMENTS
|
The unproved conjecture that 2n - g(n) > 0 would imply Legendre's conjecture, since the next prime after max {p < n^2} will always occur before (n+1)^2.
|
|
LINKS
|
|
|
FORMULA
|
|
|
MAPLE
|
|
|
MATHEMATICA
|
Table[2i - (Prime[PrimePi[i^2]+1]-Prime[PrimePi[i^2]]), {i, 2, 1000}]
f[n_] := 2 n - Prime[PrimePi[n^2] + 1] + Prime[PrimePi[n^2]]; Table[ f@n, {n, 2, 69}] (* Robert G. Wilson v, Aug 17 2009 *)
|
|
PROG
|
(Magma) [2*n-(NthPrime(#PrimesUpTo(n^2)+1)-NthPrime(#PrimesUpTo(n^2))): n in [2..100]]; // Vincenzo Librandi, Aug 02 2015
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|