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 A362470 #8 Apr 23 2023 22:45:37
%S A362470 1,2,1,3,1,4,1,4,1,2,1,6,1,2,1,5,1,6,1,5,1,2,1,8,1,2,1,3,1,4,1,6,1,2,
%T A362470 1,9,1,2,1,7,1,6,1,3,1,2,1,10,1,2,1,3,1,8,1,4,1,2,1,8,1,2,1,7,1,4,1,3,
%U A362470 1,2,1,12,1,2,1,3,1,4,1,9,1,2,1,11,1,2,1,4,1,6,1,3,1,2
%N A362470 Number of divisors d of n such that phi(d) | n.
%F A362470 a(n) = Sum_{d|n, phi(d)|n} 1.
%t A362470 a[n_] := DivisorSum[n, 1 &, Divisible[n, EulerPhi[#]] &]; Array[a, 100] (* _Amiram Eldar_, Apr 22 2023 *)
%o A362470 (PARI) a(n) = sumdiv(n, d, !(n % eulerphi(d))); \\ _Michel Marcus_, Apr 22 2023
%Y A362470 Cf. A000010, A069932.
%K A362470 nonn,easy
%O A362470 1,2
%A A362470 _Wesley Ivan Hurt_, Apr 21 2023