OFFSET
1,1
LINKS
Robert Israel, Table of n, a(n) for n = 1..5000
EXAMPLE
a(3) = 119 is a term because 119 = 5*19+5+19 = 3*29+3+29 are the two ways to produce 119 = p*q+p+q with primes p < q.
MAPLE
N:= 10000: # to produce terms <= N
R:= Vector(N):
P:= select(isprime, [2, seq(i, i=3..N/3, 2)]):
for i from 1 to nops(P) do
for j from 1 to i-1 do
v:=P[i]*P[j]+P[i]+P[j];
if v <= N then R[v]:= R[v]+1 fi
od od:
select(t -> R[t]=2, [$1..N]);
PROG
(Python)
from sympy import primerange
from collections import Counter
def aupto(limit):
primes = list(primerange(2, limit//3+1))
nums = [p*q+p+q for i, p in enumerate(primes) for q in primes[i+1:]]
counts = Counter([k for k in nums if k <= limit])
return sorted(k for k in counts if counts[k] == 2)
print(aupto(2604)) # Michael S. Branicky, Aug 10 2021
CROSSREFS
KEYWORD
nonn
AUTHOR
J. M. Bergot and Robert Israel, Aug 10 2021
STATUS
approved