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!)
A131368 Coprime semiprimes: a(n-1) and a(n) are the closest coprime semiprimes. 2

%I #13 Jun 11 2023 14:16:31

%S 4,9,10,21,22,25,26,33,34,35,38,39,46,49,51,55,57,58,65,69,74,77,82,

%T 85,86,87,91,93,94,95,106,111,115,118,119,121,122,123,133,134,141,142,

%U 143,145,146,155,158,159,161,166,169,177,178,183,185,187,194,201,202,203

%N Coprime semiprimes: a(n-1) and a(n) are the closest coprime semiprimes.

%C The slowest increasing sequence of semiprimes with coprime neighbor terms.

%H Robert Israel, <a href="/A131368/b131368.txt">Table of n, a(n) for n = 1..10000</a>

%F gcd(a(n-1), a(n)) = 1.

%p A[1]:= 4: t:= 4: count:= 1:

%p for x from 5 while count < 100 do

%p if igcd(x, t) = 1 then

%p if numtheory:-bigomega(x)=2 then

%p count:= count+1;

%p A[count]:= x;

%p t:= x;

%p fi

%p fi

%p od:

%p seq(A[i], i=1..100); # _Robert Israel_, Jun 11 2023

%o (PARI) lista(nn) = {my(vsp = select((x->(bigomega(x) == 2)), vector(nn, k, k)), i = 1, last); while (i <= #vsp, print1(vsp[i], ", "); last = vsp[i]; while(gcd(vsp[i], last) != 1, i++; if (i>#vsp, break)););} \\ _Michel Marcus_, Jun 25 2019

%Y Cf. A051884, A061766, A107621, A109412.

%Y Subsequence of A001358 (semiprimes).

%K nonn

%O 1,1

%A _Zak Seidov_, Sep 30 2007

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 April 18 11:12 EDT 2024. Contains 371779 sequences. (Running on oeis4.)