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 A166718 #20 Jun 02 2025 02:09:36 %S A166718 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26, %T A166718 27,28,29,30,31,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,49,50,51, %U A166718 52,53,54,55,56,57,58,59,60,61,62,63,65,66,67,68,69,70,71,73,74,75,76 %N A166718 Numbers with at most 4 prime factors (counted with multiplicity). %C A166718 Complement of A046304, A001222(a(n)) <= 4. %C A166718 Maynard shows there are infinitely many integers n such that the interval [n,n+90] contains 2 primes and a number with at most 4 prime factors [_Jonathan Vos Post_, May 23 2012] %C A166718 Subset of the 5-free numbers (numbers where each exponent in the prime factorization is <=4). - _R. J. Mathar_, Aug 08 2012 %H A166718 G. C. Greubel, <a href="/A166718/b166718.txt">Table of n, a(n) for n = 1..10000</a> %H A166718 James Maynard, <a href="http://arxiv.org/abs/1205.5020">Bounded length intervals containing two primes and an almost-prime</a>, arXiv:1205.5020v1 [math.NT], May 22 2012 %F A166718 UNION of A000040, A001358, A014612, and A014613. - _R. J. Mathar_, Aug 08 2012 %e A166718 88 = 2*2*2*11 is in the sequence since it has 4 prime factors %e A166718 72 = 2*2*2*3*3 is not in the sequence since it has 5 prime factors %t A166718 Select[Range[100],PrimeOmega[#]<= 4 &] (* _G. C. Greubel_, May 24 2016 *) %o A166718 (PARI) isA166718(n) = (bigomega(n) <= 4) %Y A166718 Cf. A046304, A001222 %Y A166718 For numbers with at most n prime factors: n=1: A000040, n=2: A037143, n=3: A037144, n=5: A166719 %K A166718 easy,nonn %O A166718 1,2 %A A166718 _Michael B. Porter_, Oct 20 2009