A359638 a(n) is the least odd prime not in A001359 such that all subsequent composites in the gap up to the next prime have exactly n prime factors, counted with multiplicity.

601, 1429, 81547, 248749, 27140749, 310314157, 3566181247

Offset

3,1

Links

Table of n, a(n) for n=3..9.

Prog

(PARI) a359638(maxp) = {my (k=3, pp=3); forprime (p=5, maxp, my (mi=oo, ma=0); if (p-pp>2, for (j=pp+1, p-1, my(mo=bigomega(j)); if(mo<k, mi=ma=0; break); mi=min(mo, mi); ma=max(mo, ma)); if (mi==k && ma==k, print1(pp, ", "); k++)); pp=p)};
a359638(10^8)

Crossrefs

Cf. A001222, A001359, A062502, A359636, A359637.

Sequence in context: A325089 A050202 A031422 * A078966 A255024 A362323

Adjacent sequences: A359635 A359636 A359637 * A359639 A359640 A359641

Keyword

nonn,more,hard

Author

Hugo Pfoertner, Jan 16 2023

Status

approved