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 A163368 #14 Sep 08 2022 08:45:46
%S A163368 1,2,2,2,2,6,2,6,2,6,2,4,2,6,6,2,2,4,2,4,6,6,2,8,2,6,6,4,2,8,2,4,6,6,
%T A163368 6,12,2,6,6,8,2,8,2,4,4,6,2,6,2,4,6,4,2,8,6,8,6,6,2,12,2,6,4,4,6,8,2,
%U A163368 4,6,8,2,12,2,6,4,4,6,8,2,6,2,6,2,12,6
%N A163368 a(n) = phi(sigma(tau(n))).
%H A163368 G. C. Greubel, <a href="/A163368/b163368.txt">Table of n, a(n) for n = 1..1000</a>
%F A163368 a(n) = A000010(A000203(A000005(n))) = A000010(A062069(n)) = A062401(A000005(n)).
%F A163368 a(1) = 1, a(p) = 2 for p = primes (A000040), a(pq) = 6 for pq = product of two distinct primes (A006881), a(pq...z) = A000010(2^(k+1)-1) = A053287(k+1) for pq...z = product of k (k > 2) distinct primes p,q,...,z (A120944).
%p A163368 with(numtheory): A163368:=n->phi(sigma(tau(n))): seq(A163368(n), n=1..150); # _Wesley Ivan Hurt_, Dec 19 2016
%t A163368 Table[EulerPhi[DivisorSigma[1, DivisorSigma[0, n]]], {n, 100}] (* _G. C. Greubel_, Dec 19 2016 *)
%o A163368 (PARI) vector(50, n, eulerphi(sigma(numdiv(n)))) \\ _G. C. Greubel_, Dec 19 2016
%o A163368 (Magma) [EulerPhi(SumOfDivisors(NumberOfDivisors(n))): n in [1..80]]; // _Vincenzo Librandi_, Dec 21 2016
%Y A163368 Cf. A000005, A000010, A000040, A000203, A006881, A053287, A062069, A062401, A120944.
%K A163368 nonn,easy
%O A163368 1,2
%A A163368 _Jaroslav Krizek_, Jul 25 2009