OFFSET
1,2
COMMENTS
If p = prime(n), a(n) is the least k such that p*k+k-1 and p*k-k+1 are prime but for every prime q < p, q*k+k-1 and q*k-k+1 are not both prime.
LINKS
Robert Israel, Table of n, a(n) for n = 1..894
EXAMPLE
MAPLE
N:= 100: # for a(1)..a(N)
V:= Vector(N):
g:= proc(n) local ip, p; pmax;
for ip from 1 to `if`(n mod 3 = 2, 2, infinity) do
p:= ithprime(ip);
if isprime(n*p+n-1) and isprime(n*p-n+1) then return ip fi;
od:
0
end proc:
count:= 0:
for n from 1 while count < N do
v:= g(n);
if v >= 1 and v <= N and V[v] = 0 then
count:= count+1; V[v]:= n;
fi
od:
convert(V, list);
CROSSREFS
KEYWORD
nonn
AUTHOR
J. M. Bergot and Robert Israel, Apr 25 2021
STATUS
approved