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 A362181 #9 Apr 11 2023 04:18:04
%S A362181 0,0,1,0,2,1,2,1,3,1,3,2,3,3,2,2,3,3,4,3,3,3,3,3,4,4,3,3,4,5,4,5,4,5,
%T A362181 3,4,4,5,3,5,3,5,5,5,4,6,4,6,4,6,2,7,4,6,4,6,3,7,3,5,4,6,3,8,2,6,6,7,
%U A362181 4,8,4,6,6,7,3,9,4,7,4,5,5,9,6,9,4,7,3
%N A362181 Number of numbers k such that A323410(k) = n.
%C A362181 The offset is 2 since A323410(p) = 1 for all prime powers p (A246655).
%C A362181 a(0) = 1, since there is only one solution, x = 1, to A323410(x) = 0.
%H A362181 Amiram Eldar, <a href="/A362181/b362181.txt">Table of n, a(n) for n = 2..10000</a>
%F A362181 a(A362182(n)) = 0.
%F A362181 a(A362185(n)) = 1.
%F A362181 a(A362186(n)) = n.
%t A362181 ucototient[n_] := n - Times @@ (Power @@@ FactorInteger[n] - 1); ucototient[1] = 0; With[{max = 100}, ucot = Table[ucototient[n], {n, 1, max^2}]; Table[Length[Position[ucot, n]], {n, 2, max}] // Flatten]
%Y A362181 Row lengths of A362180.
%Y A362181 The unitary version of A063740.
%Y A362181 Cf. A246655, A323410, A362182 (positions of 0's), A362183 (indices of records), A362184, A362185 (positions of 1's), A362186.
%Y A362181 Similar sequences: A014197, A361967.
%K A362181 nonn
%O A362181 2,5
%A A362181 _Amiram Eldar_, Apr 10 2023