|
%I #33 Nov 26 2022 11:44:53
%S 4,33,49,55,85,91,93,119,121,141,143,159,183,185,201,203,213,215,217,
%T 219,235,247,265,287,289,299,301,303,319,321,327,339,391,393,411,413,
%U 415,445,451,469,471,515,517,527,533,535,543,551,579,581,589,633,667
%N Semiprimes k such that k+2 is also a semiprime.
%C Starting with 33 all terms are odd. First squares are 4, 49, 169, 361, 529, 961, 1369, 2209, 2809, 4489, ... - _Zak Seidov_, Feb 17 2017
%H Zak Seidov, <a href="/A092207/b092207.txt">Table of n, a(n) for n = 1..10000</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Semiprime.html">Semiprime</a>
%t PrimeFactorExponentsAdded[n_] := Plus @@ Flatten[Table[ #[[2]], {1}] & /@ FactorInteger[n]]; Select[ Range[ 668], PrimeFactorExponentsAdded[ # ] == PrimeFactorExponentsAdded[ # + 2] == 2 &]
%t Select[Range[700],PrimeOmega[#]==PrimeOmega[#+2]==2&] (* _Harvey P. Dale_, Aug 20 2011 *)
%t SequencePosition[Table[If[PrimeOmega[n]==2,1,0],{n,700}],{1,_,1}] [[All,1]] (* Requires Mathematica version 10 or later *) (* _Harvey P. Dale_, May 29 2017 *)
%o (PARI) is(n)=if(n%2==0, return(n==4)); bigomega(n)==2 && bigomega(n+2)==2 \\ _Charles R Greathouse IV_, Feb 21 2017
%o (Python)
%o from sympy import factorint
%o from itertools import count, islice
%o def agen(): # generator of terms
%o yield 4
%o nxt = 0
%o for k in count(5, 2):
%o prv, nxt = nxt, sum(factorint(k+2).values())
%o if prv == nxt == 2: yield k
%o print(list(islice(agen(), 53))) # _Michael S. Branicky_, Nov 26 2022
%Y Cf. A056809, A070552, A092125, A092126, A092127, A092128, A092129, A082919, A092209.
%K nonn
%O 1,1
%A _Robert G. Wilson v_ and _Zak Seidov_, Feb 24 2004
|
