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 A322841 #15 Jan 11 2019 16:54:21
%S A322841 0,0,0,0,0,0,1,1,1,0,2,0,3,0,0,5,5,0,6,0,0,0,9,0,10,0,11,0,12,0,13,13,
%T A322841 1,1,1,1,17,1,1,1,20,0,21,2,2,2,24,2,25,2,2,2,28,2,2,2,2,2,33,0,34,3,
%U A322841 3,36,3,0,38,4,4,0,41,5,42,5,5,5,5,0,47,6,48
%N A322841 Number of positive integers less than n with more distinct prime factors than n.
%H A322841 Alois P. Heinz, <a href="/A322841/b322841.txt">Table of n, a(n) for n = 1..20000</a>
%e A322841 Column n lists the a(n) positive integers less than n with more distinct prime factors than n:
%e A322841 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
%e A322841 ---------------------------------------------------------------------
%e A322841 6 6 6 10 12 15 15 18
%e A322841 6 10 14 14 15
%e A322841 6 12 12 14
%e A322841 10 10 12
%e A322841 6 6 10
%e A322841 6
%p A322841 b:= proc(n) option remember; nops(numtheory[factorset](n)) end:
%p A322841 a:= proc(n) option remember;
%p A322841 (t-> add(`if`(b(i)>t, 1, 0), i=1..n-1))(b(n))
%p A322841 end:
%p A322841 seq(a(n), n=1..100); # _Alois P. Heinz_, Dec 28 2018
%t A322841 Table[Length[Select[Range[n],PrimeNu[#]>PrimeNu[n]&]],{n,100}]
%o A322841 (PARI) a(n) = my(omegan=omega(n)); sum(k=1, n-1, omega(k) > omegan); \\ _Michel Marcus_, Dec 29 2018
%o A322841 (PARI) first(n) = {my(t = 1, pp = 1, res = vector(n)); forprime(p = 2, oo, pp*=p; if(pp > n, v = vector(t); break); t++); for(i = 1, n, o = omega(i); res[i] = v[o+1]; for(j = 1, o, v[j]++)); res} \\ _David A. Corneth_, Dec 29 2018
%Y A322841 Positions of zeros are A116998.
%Y A322841 Cf. A000010, A000961, A001221, A006049, A058933, A067003, A294277, A302242, A322837, A322838.
%K A322841 nonn
%O A322841 1,11
%A A322841 _Gus Wiseman_, Dec 28 2018