# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a111153
Showing 1-1 of 1

%I A111153 #34 Feb 24 2024 01:12:39
%S A111153 4,10,25,34,38,46,55,57,77,91,93,106,118,123,129,133,143,145,159,161,
%T A111153 169,177,185,201,203,205,206,213,218,226,235,259,267,289,291,295,298,
%U A111153 305,314,327,334,335,339,358,361,365,377,381,394,395,403,407,415,417
%N A111153 Sophie Germain semiprimes: semiprimes n such that 2n+1 is also a semiprime.
%C A111153 Define a generalized Sophie Germain n-prime of degree m, p, to be an n-prime (n-almost prime) such that 2p+1 is an m-prime (m-almost prime). For example, p=24 is a Sophie Germain 4-prime of degree 2 because 24 is a 4-prime and 2*24+1=49 is a 2-prime. Then this sequence gives all the Sophie Germain 2-primes of degree 2.
%H A111153 Marius A. Burtea, <a href="/A111153/b111153.txt">Table of n, a(n) for n = 1..7675</a> (first 1000 terms from T. D. Noe)
%F A111153 a(n) = (A176896(n) - 1)/2. - _Zak Seidov_, Sep 10 2012
%e A111153 a(4)=34 because 34 is the 4th semiprime such that 2*34+1=69 is also a semiprime.
%t A111153 SemiPrimeQ[n_] := (Plus@@Transpose[FactorInteger[n]][[2]]==2); Select[Range[2, 500], SemiPrimeQ[ # ]&&SemiPrimeQ[2#+1]&] (* _T. D. Noe_, Oct 20 2005 *)
%t A111153 fQ[n_] := Plus @@ Last /@ FactorInteger[n] == 2; Select[ Range[445], fQ[ # ] && fQ[2# + 1] &] (* _Robert G. Wilson v_, Oct 20 2005 *)
%t A111153 Flatten@Position[PrimeOmega@{#,1+2*#}&/@Range@1000,{2,2}] (* _Hans Rudolf Widmer_, Nov 25 2023 *)
%o A111153 (Magma) f:=func< n | &+[k[2]: k in Factorization(n)] eq 2 >; [ n: n in [4..500] | f(n) and f(2*n+1)]; // _Marius A. Burtea_, Jan 04 2019
%o A111153 (PARI) isok(n) = (bigomega(n) == 2) && (bigomega(2*n+1) == 2); \\ _Michel Marcus_, Jan 04 2019
%Y A111153 Cf. A005384, A001358, A111168, A111170, A111171, A111173, A111176, A176896.
%K A111153 nonn
%O A111153 1,1
%A A111153 Christopher M. Tomaszewski (cmt1288(AT)comcast.net), Oct 19 2005
%E A111153 Corrected and extended by _T. D. Noe_, _Ray Chandler_ and _Robert G. Wilson v_, Oct 20 2005

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE