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 A193454 #18 Jan 08 2017 13:02:16
%S A193454 1,1,1,1,1,1,4,1,4,1,6,1,4,4,1,1,1,4,13,1,4,6,12,1,6,4,13,4,8,1,24,1,
%T A193454 6,1,4,4,13,13,4,1,6,4,32,6,4,12,24,1,32,6,1,4,14,13,6,4,13,8,30,1,24,
%U A193454 24,13,1,4,6,48,1,12,4,48,4,13,13,6,13,24,4
%N A193454 Sum of odd divisors of phi(n).
%C A193454 Phi(n): A000010 is the Euler totient function. This sequence equals A193254(n) for n < 63.
%H A193454 Indranil Ghosh, <a href="/A193454/b193454.txt">Table of n, a(n) for n = 1..10000</a>
%F A193454 a(n) = A000593(A000010(n)). - _Michel Marcus_, Jan 14 2014
%e A193454 a(63) = 13 because phi(63) = 36, and the sum of the 3 odd divisors {1, 3, 9} is 13.
%t A193454 Table[Total[Select[Divisors[EulerPhi[n]], OddQ[ # ]&]], {n, 58}]
%o A193454 (PARI) a(n) = sumdiv(eulerphi(n), d, (d%2)*d); \\ _Michel Marcus_, Jan 14 2014
%Y A193454 Cf. A000010, A193254.
%K A193454 nonn
%O A193454 1,7
%A A193454 _Michel Lagneau_, Jul 26 2011