|
|
A060268
|
|
Distance of 2n from the closest prime.
|
|
7
|
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 3, 1, 1, 1, 3, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 3, 1, 1, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 5, 7, 5, 3, 1, 1, 1, 1, 3, 1, 1, 1, 3, 5, 3, 1, 1, 1, 3, 1, 1, 3, 1, 1, 1, 1, 3, 1, 1, 3, 1, 1, 1, 3, 5, 3, 1, 1, 1, 1, 1, 1, 3, 5, 5, 3, 1, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
2,12
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
n=13, 2n=26 surrounded by 23 and 29 which are from 26 in equal distance of 3 and min{3,3}=3=a(13).
|
|
MAPLE
|
with(numtheory): [seq(min(nextprime(2*i)-2*i, 2*i-prevprime(2*i)), i=2...256)];
|
|
MATHEMATICA
|
a[n_] := Min[NextPrime[2*n] - 2*n, 2*n - NextPrime[2*n, -1]]; Array[a, 100, 2] (* Amiram Eldar, Sep 16 2020 *)
|
|
PROG
|
(PARI) a(n) = min(2*n - precprime(2*n-1), nextprime(2*n+1) - 2*n); \\ Michel Marcus, Sep 16 2020
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|