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.
%I A359638 #4 Jan 28 2023 12:12:41
%S A359638 601,1429,81547,248749,27140749,310314157,3566181247
%N 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.
%o A359638 (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)};
%o A359638 a359638(10^8)
%Y A359638 Cf. A001222, A001359, A062502, A359636, A359637.
%K A359638 nonn,more,hard
%O A359638 3,1
%A A359638 _Hugo Pfoertner_, Jan 16 2023