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!)
A359636 a(n) is the least odd prime not in A001359 such that all subsequent composites in the gap up to the next prime have at least n distinct prime factors. 5
7, 19, 643, 51427, 8083633, 1077940147, 75582271489, 34710483181813 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
a(9) <= 76340177205657727, a(10) <= 225096507194749219819. - David A. Corneth, Jan 12 2023
LINKS
Nilotpal Kanti Sinha, Are there highly composite prime gaps? Question in mathoverflow, with an answer by Terry Tao, Jan 19 2022.
EXAMPLE
a(1) = 7: trivially, the 3 composites 8 = 2^3, 9 = 3^2, 10 = 2*5, have at least one distinct prime factor;
a(2) = 19: 20 = 2^2*5, 21 = 3*7, 22 = 2*11 all have 2 distinct prime factors;
a(3) = 643: 644 = 2^2*7*23, 645 = 3*5*43, 646 = 2*17*19, 647 is prime.
PROG
(PARI) a359636(maxp) = {my (k=1, pp=3); forprime (p=5, maxp, my(mi=oo); if (p-pp>2, for (j=pp+1, p-1, my(mo=omega(j)); if (mo<k, mi=0; break); mi=min(mo, mi)); if (mi>=k, print1(pp, ", "); k++)); pp=p)};
a359636(10^7)
CROSSREFS
Sequence in context: A221740 A364572 A335990 * A330875 A330852 A267237
KEYWORD
nonn,hard,more
AUTHOR
Hugo Pfoertner, Jan 12 2023
EXTENSIONS
a(8) from Martin Ehrenstein, Nov 03 2023
STATUS
approved

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 25 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)