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 A069924 #17 Mar 12 2025 18:13:08
%S A069924 1,2,2,3,3,4,4,5,5,5,5,6,6,6,6,7,7,8,8,8,8,8,8,9,9,9,9,9,9,9,9,10,10,
%T A069924 10,10,11,11,11,11,11,11,11,11,11,11,11,11,12,12,12,12,12,12,13,13,13,
%U A069924 13,13,13,13,13,13,13,14,14,14,14,14,14,14,14,15,15,15,15,15,15,15,15
%N A069924 Number of k, 1<=k<=n, such that phi(k) divides k.
%H A069924 Vaclav Kotesovec, <a href="/A069924/b069924.txt">Table of n, a(n) for n = 1..10000</a>
%H A069924 Vaclav Kotesovec, <a href="/A069924/a069924.jpg">Plot of a(n)/log(n)^2 for n = 1..10000</a>
%F A069924 a(n) = Card(k: 1<=k<=n : k==0 (mod phi(k))) asymptotically: a(n) = C*log(n)^2 + o(log(n)^2) with C=0.6....
%F A069924 a(n) = A071521(n) - A062153(n). - _Ridouane Oudra_, Mar 05 2025
%t A069924 Table[Length[Select[Range[n], Divisible[#, EulerPhi[#]] &]], {n, 1, 100}] (* _Vaclav Kotesovec_, Feb 16 2019 *)
%t A069924 Accumulate[Table[If[Divisible[n,EulerPhi[n]],1,0],{n,80}]] (* _Harvey P. Dale_, Jul 04 2021 *)
%o A069924 (PARI) for(n=1,150,print1(sum(i=1,n,if(i%eulerphi(i),0,1)),","))
%Y A069924 Cf. A007694, A071521, A062153.
%K A069924 easy,nonn
%O A069924 1,2
%A A069924 _Benoit Cloitre_, May 05 2002