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 A329204 #42 Oct 27 2023 19:52:33
%S A329204 0,1,0,1,0,3,0,2,1,4,0,6,0,4,2,3,0,8,0,6,3,5,0,10,1,6,3,8,0,16,0,7,4,
%T A329204 9,2,15,0,9,4,14,0,21,0,10,7,9,0,21,2,15,5,11,0,22,5,14,7,11,0,33,0,
%U A329204 12,10,12,3,29,0,15,6,26,0,28,0,16,13,18,4,34,0,24,7,17
%N A329204 Number of integers less than n having at least as many totatives as n.
%H A329204 Charles R Greathouse IV, <a href="/A329204/b329204.txt">Table of n, a(n) for n = 1..10000</a> (first 2000 terms from Joshua Oliver)
%H A329204 Wikipedia, <a href="https://en.wikipedia.org/wiki/Totative">Totative</a>.
%e A329204 a(6) = 3, because 6 has 2 totatives and there are 3 integers less than 6 with 2 or more totatives: 3 with 2 totatives, 4 with 2 totatives, and 5 with 4 totatives.
%t A329204 Table[Length[Select[Range[n-1],EulerPhi[#]>=EulerPhi[n]&]],{n,1,100}]
%o A329204 (PARI) a(n) = sum(k=1, n-1, eulerphi(k) >= eulerphi(n)); \\ _Michel Marcus_, Nov 22 2019
%o A329204 (PARI) first(n)=my(u=vectorsmall(n),v=vector(n)); forfactored(f=1,n,u[f[1]]=eulerphi(f)); for(i=1,n, v[i]=sum(j=1,i-1,u[j]>=u[i])); v \\ _Charles R Greathouse IV_, Dec 11 2019
%Y A329204 Cf. A000010.
%K A329204 nonn,look
%O A329204 1,6
%A A329204 _Joshua Oliver_, Nov 22 2019