OFFSET
1,2
COMMENTS
If p = prime(n), a(n) is the least m such that there is some prime q with m*p <= q < (m+1)*p and A000720(q) = n + q - m*p.
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
EXAMPLE
MAPLE
f:= proc(n) local p, k;
p:= ithprime(n);
for k from 1 do
if ithprime(n+k) - k mod p = 0 then return (ithprime(n+k)-k)/p fi
od:
end proc:
map(f, [$1..150]);
CROSSREFS
KEYWORD
nonn
AUTHOR
Robert Israel, Oct 29 2017
STATUS
approved