OFFSET
1,1
COMMENTS
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
EXAMPLE
1371 is in the sequence because 1371 = 3 * 457, and 3 + 1 = 4 and 457 + 1 = 2 * 229 are semiprimes.
MAPLE
with(numtheory):for n from 2 to 3000 do: x:=factorset(n):y:=bigomega(n):z:=x[1]:zz:=n/z:if y=2 and type(z, prime)=true and type(zz, prime) = true and bigomega(z+1)=2 and bigomega(zz+1)=2 then printf(`%d, `, n): else fi:od:
# Alternate:
N:= 10000: # to get all terms <= N
P:= select(p -> isprime(p) and numtheory:-bigomega(p+1)=2, [$1..N/3]):
nP:= nops(P):
sort(select(`<=`, [seq(seq(P[i]*P[j], i=1..j), j=1..nP)], N)); # Robert Israel, Mar 22 2018
MATHEMATICA
Take[Sort[Times@@@Select[Flatten[Table[{Prime[p], Prime[q]}, {p, 2, 200}, {q, p}], 1], PrimeOmega[#[[1]] + 1] == 2 && PrimeOmega[#[[2]] + 1] == 2 &]], 45] (* Alonso del Arte, Jul 18 2011 *)
cQ[n_]:=Module[{fi=FactorInteger[n]}, Which[PrimeOmega[n]==2&&IntegerQ[Sqrt[ n]], PrimeOmega[ Sqrt[n]+1]==2, PrimeOmega[n] == 2, PrimeOmega[ 1+ fi[[All, 1]]] =={2, 2}, True, False]]; Select[Range[3000], cQ]
PROG
(PARI) list(lim)=my(v=List(), u=List(), t); forprime(p=3, lim\3, if(isprime((p+1)/2), listput(v, p))); for(i=1, #v, for(j=i, #v, t=v[i]*v[j]; if(t>lim, break); listput(u, t))); vecsort(Vec(u)) \\ Charles R Greathouse IV, Jul 18 2011
CROSSREFS
KEYWORD
nonn
AUTHOR
Michel Lagneau, Jul 18 2011
STATUS
approved