login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A111153 Sophie Germain semiprimes: semiprimes n such that 2n+1 is also a semiprime. 20
4, 10, 25, 34, 38, 46, 55, 57, 77, 91, 93, 106, 118, 123, 129, 133, 143, 145, 159, 161, 169, 177, 185, 201, 203, 205, 206, 213, 218, 226, 235, 259, 267, 289, 291, 295, 298, 305, 314, 327, 334, 335, 339, 358, 361, 365, 377, 381, 394, 395, 403, 407, 415, 417 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

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.

LINKS

T. D. Noe, Table of n, a(n) for n=1..1000

EXAMPLE

a(4)=34 because 34 is the 4th semiprime such that 2*34+1=69 is also a semiprime.

MATHEMATICA

SemiPrimeQ[n_] := (Plus@@Transpose[FactorInteger[n]][[2]]==2); Select[Range[2, 500], SemiPrimeQ[ # ]&&SemiPrimeQ[2#+1]&] (Noe)

fQ[n_] := Plus @@ Last /@ FactorInteger[n] == 2; Select[ Range[445], fQ[ # ] && fQ[2# + 1] &] (* Robert G. Wilson v *)

CROSSREFS

Cf. A005384, A001358, A111168, A111170, A111171, A111173, A111176.

Sequence in context: A127070 A107961 A051864 * A145368 A111207 A113412

Adjacent sequences:  A111150 A111151 A111152 * A111154 A111155 A111156

KEYWORD

nonn

AUTHOR

Christopher M. Tomaszewski (cmt1288(AT)comcast.net), Oct 19 2005

EXTENSIONS

Corrected and extended by T. D. Noe (noe(AT)sspectra.com), Ray Chandler (rayjchandler(AT)sbcglobal.net) and Robert G. Wilson v (rgwv(at)rgwv.com), Oct 20 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 10:05 EST 2012. Contains 206009 sequences.