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 A163367 #10 Dec 21 2016 02:41:52
%S A163367 1,1,2,1,2,2,2,2,1,2,2,2,2,4,4,1,2,2,2,4,2,6,4,4,1,4,4,4,4,4,2,2,4,4,
%T A163367 4,2,2,4,4,4,4,4,2,4,4,4,4,2,2,2,4,2,4,8,4,8,4,4,4,8,2,4,4,1,4,8,2,4,
%U A163367 4,8,4,4,2,4,2,4,4,8,4,4,2,4,4,4,4,4
%N A163367 a(n) = phi(tau(sigma(n))).
%H A163367 G. C. Greubel, <a href="/A163367/b163367.txt">Table of n, a(n) for n = 1..1000</a>
%F A163367 a(n) = A000010(A000005(A000203(n))) = A000010(A062068(n)) = A163109(A000203(n)).
%p A163367 with(numtheory): A163367:=n->phi(tau(sigma(n))): seq(A163367(n), n=1..150); # _Wesley Ivan Hurt_, Dec 19 2016
%t A163367 Table[EulerPhi[DivisorSigma[0, DivisorSigma[1, n]]], {n, 100}] (* _G. C. Greubel_, Dec 19 2016 *)
%o A163367 (PARI) vector(50, n, eulerphi(numdiv(sigma(n)))) \\ _G. C. Greubel_, Dec 19 2016
%Y A163367 Cf. A000005, A000010, A000203, A062068, A163109.
%K A163367 nonn,easy
%O A163367 1,3
%A A163367 _Jaroslav Krizek_, Jul 25 2009