The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A064900 Semiprimes p1*p2 such that p2 > p1 and p2 mod p1 = 2. 4

%I #21 Jul 31 2023 20:34:34

%S 15,33,35,51,69,85,87,123,141,143,159,161,177,185,213,235,249,259,267,

%T 303,321,323,335,339,393,411,447,485,501,519,533,535,537,553,573,591,

%U 635,681,685,699,717,749,753,771,785,789,807,835,843,869,871,879,899

%N Semiprimes p1*p2 such that p2 > p1 and p2 mod p1 = 2.

%H John Cerkan, <a href="/A064900/b064900.txt">Table of n, a(n) for n = 1..10000</a>

%t okQ[n_] := Module[{p, e}, {p, e} = Transpose[FactorInteger[n]]; e == {1, 1} && Mod[p[[2]], p[[1]]] == 2]; Select[Range[1000], okQ]

%o (PARI) isok(n) = (bigomega(n)==2) && (f=factor(n)) && (#f~ == 2) && ((f[2,1] % f[1,1]) == 2); \\ _Michel Marcus_, May 20 2017

%Y Cf. A001358 (p2 mod p1 = 0), A064899-A064911.

%K nonn

%O 1,1

%A _Patrick De Geest_, Oct 13 2001

%E Name clarified by _Sean A. Irvine_, Jul 31 2023

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 1 12:19 EDT 2024. Contains 373023 sequences. (Running on oeis4.)