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 A353644 #13 May 07 2022 09:42:47
%S A353644 1,1,1,1,2,1,3,1,1,2,5,1,2,3,1,4,8,1,9,2,3,5,11,1,2,1,9,1,7,1,15,4,5,
%T A353644 8,3,1,2,9,1,2,10,3,21,5,1,11,23,4,7,1,4,4,26,9,5,3,9,7,29,1,2,15,3,
%U A353644 16,2,5,33,8,11,1,35,1,2,1,2,3,15,1,39,8,27,10,41,1,16,21,7,5,11,1,3,11,15,23,9,4,16,7
%N A353644 a(n) = phi(n) / gcd(phi(n), phi(sigma(n))).
%C A353644 Denominator of ratio A062401(n) / A000010(n), phi(sigma(n)) / phi(n).
%H A353644 Antti Karttunen, <a href="/A353644/b353644.txt">Table of n, a(n) for n = 1..16384</a>
%H A353644 Antti Karttunen, <a href="/A353644/a353644.txt">Data supplement: n, a(n) computed for n = 1..65537</a>
%H A353644 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%F A353644 a(n) = A000010(n) / A353643(n) = A000010(n) / gcd(A000010(n), A062401(n)).
%t A353644 a[n_] := (phi = EulerPhi[n])/GCD[phi, EulerPhi[DivisorSigma[1, n]]]; Array[a, 100] (* _Amiram Eldar_, May 06 2022 *)
%o A353644 (PARI) A353644(n) = { my(ph=eulerphi(n)); (ph / gcd(eulerphi(sigma(n)), ph)); };
%Y A353644 Cf. A000010, A000203, A062401, A353637, A353643, A353646 (numerators).
%K A353644 nonn,frac
%O A353644 1,5
%A A353644 _Antti Karttunen_, May 06 2022