OFFSET
1,1
COMMENTS
For any distinct composites a,b and any d>1 such that (a*b-1)*d and a+b are coprime, by Dirichlet's theorem there are infinitely many primes a*b*d*k - (a + b + d*k). For example, taking a=4, b=6 and d=3, the sequence includes the infinitely many primes == 59 (mod 69) except 59.
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
EXAMPLE
a(3) = 409 is a term because 409 = 6 * 8 * 9 - (6 + 8 + 9) is prime, where 6, 8, 9 are distinct composites.
MAPLE
N:= 10^4: # for terms <= N
R:= {}:
for i from 4 while i^3 - 3*i < N do
if isprime(i) then next fi;
for j from i+1 while i * j^2 - i - 2*j < N do
if isprime(j) then next fi;
for k from j+1 do
v:= i*j*k-(i+j+k);
if v > N then break fi;
if not isprime(k) and isprime(v) then R:= R union {v} fi
od od od:
R:=sort(convert(R, list));
CROSSREFS
KEYWORD
nonn
AUTHOR
Robert Israel, Dec 17 2025
STATUS
approved
