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!)
A365222 a(n) is the least semiprime such that a(n) - n and a(n) + n are the previous and the next semiprimes. 0

%I #6 Aug 27 2023 02:04:23

%S 34,185,262,407,314,371,194,2271,6218,4237,109898,110645,53602,169773,

%T 112298,163985,284738,48529,1033378,1781833,570502,1963091,12527458,

%U 6051613,30377422,19549343,66761746,7926901,363311378,5861227,676386278,136503631,72622874,51204973,375025874

%N a(n) is the least semiprime such that a(n) - n and a(n) + n are the previous and the next semiprimes.

%e a(3) = 262 because 262 = 2 * 131 is a semiprime, the previous semiprime is 262 - 3 = 259 = 7 * 37, the next semiprime is 262 + 3 = 265 = 5 * 53, and no semiprime less than 262 works.

%p N:= 46: # for a(1) .. a(N)

%p V:= Vector(N):

%p b:= 6: d:= 2: count:= 0:

%p for i from 7 while count < N do

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

%p ib:= i-b;

%p if ib = d and ib <= N then

%p if V[d] = 0 then V[d]:= b; count:= count+1 fi

%p else d:= ib

%p fi;

%p b:= i;

%p fi;

%p od:

%p convert(V,list);

%Y Cf. A001358, A213025.

%K nonn

%O 1,1

%A _Zak Seidov_ and _Robert Israel_, Aug 26 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 12 11:10 EDT 2024. Contains 373331 sequences. (Running on oeis4.)