OFFSET
1,1
COMMENTS
LINKS
D. W. Wilson, Table of n, a(n) for n = 1..10000
FORMULA
a(n) >> n log n since either n or n+1 is in A100484. - Charles R Greathouse IV, Jul 21 2015
a(n) = A109373(n) - 1. - Zak Seidov Dec 19 2018
MATHEMATICA
f[n_]:=Last/@FactorInteger[n]=={1, 1}||Last/@FactorInteger[n]=={2}; lst={}; Do[If[f[n]&&f[n+1], AppendTo[lst, n]], {n, 7!}]; lst (* Vladimir Joseph Stephan Orlovsky, Feb 25 2010 *)
Flatten[Position[Partition[Table[If[PrimeOmega[n]==2, 1, 0], {n, 700}], 2, 1], {1, 1}]] (* Harvey P. Dale, Feb 04 2015 *)
Select[Range[700], PrimeOmega[#] == PrimeOmega[# + 1] == 2 &] (* Vincenzo Librandi, Jan 22 2016 *)
PROG
(PARI) forprime(p=3, 1e3, if(bigomega(2*p-1)==2, print1(2*p-1", ")); if(bigomega(2*p+1)==2, print1(2*p", "))) \\ Charles R Greathouse IV, Nov 09 2011
(PARI) is(n)=if(n%2, isprime((n+1)/2) && bigomega(n)==2, isprime(n/2) && bigomega(n+1)==2) \\ Charles R Greathouse IV, Sep 08 2015
(Magma) IsSemiprime:=func< n | &+[k[2]: k in Factorization(n)] eq 2 >; [ n: n in [4..700] | IsSemiprime(n) and IsSemiprime(n+1) ]; // Vincenzo Librandi, Jan 22 2016
(Python)
from sympy import factorint
def is_semiprime(n): return sum(e for e in factorint(n).values()) == 2
def ok(n): return is_semiprime(n) and is_semiprime(n+1)
print(list(filter(ok, range(698)))) # Michael S. Branicky, Sep 14 2021
CROSSREFS
KEYWORD
nonn
AUTHOR
Sharon Sela (sharonsela(AT)hotmail.com), May 03 2002
EXTENSIONS
More terms from Vladeta Jovovic, May 03 2002
STATUS
approved