This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
a(0) = 2, a(3) = 7 as the product 8*9*10 has three prime divisors 2, 3 and 5.
a(11)+1 = 2*2*2*3*3*3*3*3*3*3*3*3*3 = 472392.
nn=10^15; Sort[Reap[Do[n=2^i 3^j; If[n<=nn && PrimeQ[n-1] && PrimeQ[n+1], Sow[n-1]], {i, Log[2, nn]}, {j, Log[3, nn]}]][[2, 1]]]
Select[Select[Partition[Prime[Range[38*10^5]],2,1],#[[2]]-#[[1]]==2&][[All,1]],FactorInteger[#+1][[All,1]]=={2,3}&] (* The program generates the first 15 terms of the sequence. *)
seq[max_] := Select[Sort[Flatten[Table[2^i*3^j - 1, {i, 1, Floor[Log2[max]]}, {j, 1, Floor[Log[3, max/2^i]]}]]], And @@ PrimeQ[# + {0, 2}] &]; seq[2*10^15] (* Amiram Eldar, Aug 27 2024 *)
a:=[]; for k in PrimesInInterval(2,3000) do b:={}; for s in [k..NextPrime(k)-1] do if not IsPrime(s) then b:=b join Set(PrimeDivisors(s)); end if; end for; if #Set(b) eq 3 then Append(~a,k); end if; end for; a; // Marius A. Burtea, Sep 26 2019
For p = 79, the next prime number is 83. The numbers between 79 and 83 and the prime divisors are respectively 80 { 2, 5 }, 81 { 3 }, 82 { 2, 41 }. The set of prime divisors is { 2, 3, 5, 41 } and has 4 elements, so 79 is a term. - _Marius A. Burtea_, Sep 26 2019
a:=[]; for p in PrimesInInterval(2,4800) do b:={}; for s in [p..NextPrime(p)-1] do if not IsPrime(s) then b:=b join Set(PrimeDivisors(s)); end if; end for; if #Set(b) eq 4 then Append(~a,p); end if; end for; a; // Marius A. Burtea, Sep 26 2019
Select[Prime@ Range@ 650, Length@ Union@ Flatten@ Map[First /@ FactorInteger@ # &, Select[Range[#, NextPrime@ #], CompositeQ]] == 4 &] (* Michael De Vlieger, May 27 2016 *) Join[{13,79},Select[Prime[Range[23,650]],PrimeQ[#+2]&&PrimeNu[#+1]==4&]] (* This program assumes the correctness of the conjecture by Charles R. Greathouse, IV, in the Comments. *) (* Harvey P. Dale, Jun 07 2019 *)
lista(nn)=forprime(p=2, nn, allp = []; forcomposite (c = p+1, nextprime(p+1), allp = Set(concat(allp, (factor(c)[,1])~));); if (#allp == 4, print1(p, ", "));); \\ Michel Marcus, May 28 2016
is(n)=if(!isprime(n), return(0)); if(isprime(n+2), return(omega(n+1)==4)); if(isprime(n+4), omega(n+1)+omega(n+2)+omega(n+3)==5, 0) list(lim)=my(v=List(),t,p); lim\=1; for(e=4,logint(lim+2,3), p=precprime(3^e); if(isprime(p+4) && is(p), listput(v,p))); for(e=4,logint(lim+3,2), p=precprime(2^e); if(isprime(p+4) && is(p), listput(v,p))); p=2; forprime(q=3,lim+2, if(q-p==2 && omega(p+1)==4, listput(v,p)); p=q); Set(v) \\ Charles R Greathouse IV, Jun 01 2016
a:=[]; for k in PrimesInInterval(2,25000) do b:={}; for s in [k..NextPrime(k)-1] do if not IsPrime(s) then b:=b join Set(PrimeDivisors(s)); end if; end for; if #Set(b) eq 5 then Append(~a,k); end if; end for; a; // Marius A. Burtea, Sep 26 2019
dpd5Q[p_]:=Length[Union[Flatten[FactorInteger[#][[All,1]]&/@Range[ p+1,NextPrime[ p]-1]]]]==5; Select[Prime[Range[3000]],dpd5Q] (* Harvey P. Dale, Aug 11 2021 *)
Between 31 and the next prime 37, there are 5 composite numbers whose prime divisors are respectively for 32: {2}, 33: {3,11}, 34: {2,17}, 35: {5,7} and 36: {2,3}; hence, these distinct prime divisors are {2,3,5,7,11,17}, the number of these distinct prime divisors is 6, so 31 is a term. - _Bernard Schott_, Sep 26 2019
a:=[]; for k in PrimesInInterval(2,10000) do b:={}; for s in [k..NextPrime(k)-1] do if not IsPrime(s) then b:=b join Set(PrimeDivisors(s)); end if; end for; if #Set(b) eq 6 then Append(~a,k); end if; end for; a; // Marius A. Burtea, Sep 26 2019
Select[Partition[Prime[Range[1250]],2,1],Length[Union[Flatten[ FactorInteger/@ Range[ #[[1]]+1,#[[2]]-1],1][[All,1]]]]==6&][[All,1]] (* Harvey P. Dale, May 25 2020 *)
pd[n_]:=Transpose[FactorInteger[n]][[1]]; Transpose[Select[ Partition[ Prime[ Range[500]],2,1],Length[Union[Flatten[ pd/@Range[First[#]+1, Last[#]-1]]]] == 7&]][[1]] (* Harvey P. Dale, Jun 15 2013 *) Select[Prime@ Range@ 500, Length@ Union@ Flatten@ Map[First /@ FactorInteger@ # &, Select[Range[#, NextPrime@ #], CompositeQ]] == 7 &] (* Michael De Vlieger, May 27 2016 *)
For p = 131, the next prime number is 137. The numbers between 131 and 137 and the prime factors are respectively 132 { 2, 3, 11 }, 133 { 7, 19 }, 134 { 2, 67 }, 135 { 3, 5 }, 136 { 2, 17 }. The set of prime divisors is { 2, 3, 5, 7, 11, 17, 19, 67 } and has 8 elements, so 131 is a term. - _Marius A. Burtea_, Sep 26 2019
a:=[]; for p in PrimesInInterval(2,7000) do b:={}; for s in [p..NextPrime(p)-1] do if not IsPrime(s) then b:=b join Set(PrimeDivisors(s)); end if; end for; if #Set(b) eq 8 then Append(~a,p); end if; end for; a; // Marius A. Burtea, Sep 26 2019
Select[Partition[Prime[Range[1000]],2,1],Length[Union[ Flatten[ FactorInteger[ Range[ #[[1]]+1,#[[2]]-1]],1][[All,1]]]]==8&][[All,1]] (* Harvey P. Dale, Dec 26 2019 *)
For p = 233, the next prime number is 239. The numbers between 233 and 237 and the prime divisors are respectively 234 {2, 3, 13}, 235 {5, 47}, 236 {2, 59}, 237 {3, 79 }, 238 {2, 7, 17}. The set of prime divisors is {2, 3, 5, 7, 13, 17, 47, 59, 79} and has 9 elements, so 233 is a term.
a:=[]; for p in PrimesInInterval(2,5000) do b:={}; for s in [p..NextPrime(p)-1] do if not IsPrime(s) then b:=b join Set(PrimeDivisors(s)); end if; end for; if #Set(b) eq 9 then Append(~a,p); end if; end for; a; // Marius A. Burtea, Sep 26 2019
229 is a term since between 229 and its next prime, 233, there are 3 composite numbers, 230, 231 and 232 and all of them have the same number of divisors, 8.
seqQ[n_] := PrimeQ[n] && (nx=NextPrime[n]) > n + 2 && Length @ Union @ DivisorSigma[0, Range[n+1, nx-1]] == 1; Select[Range[10^6], seqQ]
Comments