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!)
A217612 Difference between n-th prime and the smallest semiprime greater than it. 1

%I #14 Sep 15 2022 12:20:40

%S 2,1,1,2,3,1,4,2,2,4,2,1,5,3,2,2,3,1,2,3,1,3,2,2,9,5,3,4,2,2,2,2,4,2,

%T 6,4,1,3,2,4,4,2,3,1,4,2,2,3,8,6,2,8,6,2,2,2,5,3,1,6,4,2,2,3,1,2,3,2,

%U 8,6,2,2,4,4,2,3,2,1,2,2,3,1,6,4,6,2,2

%N Difference between n-th prime and the smallest semiprime greater than it.

%C Similar to A121885, but with smallest semiprime greater than it.

%H Antonio Roldán, <a href="/A217612/b217612.txt">Table of n, a(n) for n = 1..1229</a>

%F a(n) = A102414(n) - A000040(n).

%e a(7) = 4, because 17 is the seventh prime and 17+1 = 18 = 2*3^2, 17+2 = 19 = 19 and 17+3 = 20 = 2^2*5 are not semiprimes, but 17+4 = 21 = 3*7 is a semiprime.

%t SemiPrimeQ[n_Integer] := If[Abs[n] < 2, False, (2 == Plus @@ Transpose[FactorInteger[Abs[n]]][[2]])]; Table[i = Prime[n] + 1; While[! SemiPrimeQ[i], i++]; i - Prime[n], {n, 87}] (* _T. D. Noe_, Oct 08 2012 *)

%t ssp[p_]:=Module[{k=1},While[PrimeOmega[p+k]!=2,k++];k]; Table[ssp[p],{p,Prime[ Range[100]]}] (* _Harvey P. Dale_, Sep 15 2022 *)

%o (PARI) m=0;forprime(n=2,10000,k=0;while(bigomega(n+k)<>2, k=k+1);m=m+1;write("B217612.txt",m," ",k)) \\ _Antonio Roldán_, Oct 08 2012

%K nonn

%O 1,1

%A _Antonio Roldán_, Oct 08 2012

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 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)