OFFSET
1,1
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
EXAMPLE
a(1) = 2 because prime 2 and ((1 + 1)*2 - 1)/1 = 3 is also prime;
a(2) = 5 because prime 5 and ((2 + 1)*5 - 1)/2 = 7 is also prime;
a(3) = 13 because prime 13 and ((3 + 1)*13 - 1)/3 = 17 is also prime.
MAPLE
f:= proc(n) local p;
for p from 1 by ilcm(n, 2) do
if isprime(p) and isprime(((n+1)*p-1)/n) then return p fi
od
end proc:
f(1):= 2:
map(f, [$1..100]); # Robert Israel, Mar 16 2026
MATHEMATICA
a[n_] := Module[{p = 2}, While[! PrimeQ[((n+1)*p - 1)/n], p = NextPrime[p]]; p]; Array[a, 62] (* Amiram Eldar, Mar 15 2026 *)
PROG
(PARI) isok(p, n) = my(k=((n+1)*p - 1)/n); (denominator(k)==1) && ispseudoprime(k);
a(n) = my(p=2); while (!isok(p, n), p = nextprime(p+1)); p; \\ Michel Marcus, Mar 16 2026
CROSSREFS
KEYWORD
nonn
AUTHOR
Juri-Stepan Gerasimov, Mar 15 2026
STATUS
approved
