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 A193169 #22 Mar 18 2016 12:24:51
%S A193169 1,1,1,1,1,1,2,1,2,1,2,1,2,2,1,1,1,2,3,1,2,2,2,1,2,2,3,2,2,1,4,1,2,1,
%T A193169 2,2,3,3,2,1,2,2,4,2,2,2,2,1,4,2,1,2,2,3,2,2,3,2,2,1,4,4,2,1,2,2,4,1,
%U A193169 2,2,4,2,3,3,2,3,4,2,4,1
%N A193169 Number of odd divisors of lambda(n).
%C A193169 Lambda is the function in A002322.
%H A193169 Reinhard Zumkeller, <a href="/A193169/b193169.txt">Table of n, a(n) for n = 1..10000</a>
%F A193169 a(n) = A001227(A002322(n)). - _Michel Marcus_, Mar 18 2016
%e A193169 a(19) = 3 because lambda(19) = 18 and the 3 odd divisors are {1, 3, 9}.
%t A193169 f[n_] := Block[{d = Divisors[CarmichaelLambda[n]]}, Count[OddQ[d], True]]; Table[f[n], {n, 80}]
%o A193169 (Haskell)
%o A193169 a193169 = length . filter odd . a027750_row . a002322
%o A193169 -- _Reinhard Zumkeller_, Sep 02 2014
%o A193169 (PARI) a(n) = sumdiv(lcm(znstar(n)[2]), d, (d%2)); \\ _Michel Marcus_, Mar 18 2016
%Y A193169 Cf. A002322.
%Y A193169 Cf. A027750, A001227.
%K A193169 nonn
%O A193169 1,7
%A A193169 _Michel Lagneau_, Jul 22 2011