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 A362186 #9 Apr 11 2023 04:17:46
%S A362186 2,0,6,10,20,31,47,53,65,77,89,113,125,119,149,173,167,179,233,279,
%T A362186 239,209,439,293,365,299,329,359,455,521,467,389,461,419,479,773,539,
%U A362186 509,599,845,671,791,749,719,659,629,809,1055,881,779,899,965,929,1121,839,1403
%N A362186 a(n) is the least number k such that the equation A323410(x) = k has exactly n solutions, or -1 if no such k exists.
%C A362186 Is there any n for which a(n) = -1?
%H A362186 Amiram Eldar, <a href="/A362186/b362186.txt">Table of n, a(n) for n = 0..1292</a>
%F A362186 A362181(a(n)) = n.
%t A362186 ucototient[n_] := n - Times @@ (Power @@@ FactorInteger[n] - 1); ucototient[1] = 0; With[{max = 300}, solnum = Table[0, {n, 1, max}]; Do[If[(i = ucototient[k]) <= max, solnum[[i]]++], {k, 2, max^2}]; Join[{2, 0}, TakeWhile[FirstPosition[ solnum, #] & /@ Range[2, max] // Flatten, NumberQ]]]
%Y A362186 The unitary version of A063507.
%Y A362186 Cf. A323410, A362181.
%Y A362186 Similar sequences: A007374, A361970.
%K A362186 nonn
%O A362186 0,1
%A A362186 _Amiram Eldar_, Apr 10 2023