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 A166719 #13 Jun 02 2025 02:09:42 %S A166719 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 A166719 27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49, %U A166719 50,51,52,53,54,55,56,57,58,59,60,61,62,63,65,66,67,68,69,70,71,72,73 %N A166719 Numbers with at most 5 prime factors (counted with multiplicity). %C A166719 Complement of A046305, A001222(a(n))<=5 %H A166719 G. C. Greubel, <a href="/A166719/b166719.txt">Table of n, a(n) for n = 1..10000</a> %e A166719 50 = 2*5*5 is in the sequence since it has 3 prime factors and 3 <= 5 %e A166719 64 = 2*2*2*2*2*2 is not in the sequence since it has 6 prime factors %t A166719 Select[Range[100],PrimeOmega[#]<6&] (* _Harvey P. Dale_, Jul 13 2011 *) %o A166719 (PARI) isA166719(n) = (bigomega(n) <= 5) %Y A166719 Cf. A046305, A001222 %Y A166719 For numbers with at most n prime factors: n=1: A000040, n=2: A037143, n=3: A037144, n=4: A166718. %K A166719 easy,nonn %O A166719 1,2 %A A166719 _Michael B. Porter_, Oct 20 2009