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 A334655 #43 Feb 26 2024 01:28:28 %S A334655 0,0,1,2,3,0,4,5,6,1,7,2,8,3,4,9,10,5,11,6,7,8,12,9,13,10,14,11,15,0, %T A334655 16,17,12,13,14,15,18,16,17,18,19,1,20,19,20,21,21,22,22,23,24,25,23, %U A334655 26,27,28,29,30,24,2,25,31,32,26,33,3,27,34,35,4,28,36,29,37,38,39,40,5,30,41 %N A334655 Number of integers less than n with the same number of distinct prime factors as n. %H A334655 Robert Israel, <a href="/A334655/b334655.txt">Table of n, a(n) for n = 1..10000</a> %F A334655 a(n) = |{j < n : omega(j) = omega(n)}|. %F A334655 a(n) = A067003(n) - 1. %e A334655 a(12) = 2 because omega(12) = 2 and also omega(6) = omega(10) = 2. %p A334655 R:= NULL: %p A334655 for n from 1 to 100 do %p A334655 w:= nops(numtheory:-factorset(n)); %p A334655 if assigned(V[w]) then V[w]:= V[w]+1 else V[w]:= 1 fi; %p A334655 R:= R, V[w]-1 %p A334655 od: %p A334655 R; # _Robert Israel_, Feb 25 2024 %t A334655 Table[Length[Select[Range[n - 1], PrimeNu[#] == PrimeNu[n] &]], {n, 80}] %o A334655 (PARI) a(n)={my(t=omega(n)); sum(k=1, n-1, omega(k)==t)} \\ _Andrew Howroyd_, Oct 31 2020 %Y A334655 Cf. A001221, A002110 (positions of 0's), A047983, A067003, A067004, A322837, A322841, A335097. %K A334655 nonn %O A334655 1,4 %A A334655 _Ilya Gutkovskiy_, Oct 31 2020