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 = 5 is also prime;
a(2) = 3 because prime 3 and ((2+1)*3 + 1)/2 = 5 is also prime;
a(3) = 2 because prime 2 and ((3+1)*2 + 1)/3 = 3 is also prime.
MAPLE
f:= proc(n) local p0, d, p;
if n::even then p0:= n-1; d:= n
else p0:= 2*n-1; d:= 2*n
fi;
for p from p0 by d do
if isprime(p) and isprime(((n+1)*p+1)/n) then return p fi
od
end proc: f(1):= 2: f(3):= 2:
map(f, [$1..100]); # Robert Israel, Mar 23 2026
MATHEMATICA
a[n_] := Module[{p = 2}, While[! PrimeQ[((n + 1)*p + 1)/n], p = NextPrime[p]]; p]; Array[a, 60] (* Amiram Eldar, Mar 23 2026 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Juri-Stepan Gerasimov, Mar 22 2026
STATUS
approved
