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 A362183 #10 Apr 11 2023 04:17:58
%S A362183 0,6,10,20,31,47,53,65,77,89,113,119,149,167,179,209,293,299,329,359,
%T A362183 389,419,479,509,599,629,779,839,989,1049,1139,1259,1469,1559,1649,
%U A362183 1679,1889,2099,2309,2729,3149,3359,3569,3989,4289,4409,4619,5249,5459,6089,6509
%N A362183 Unitary highly cototient numbers: numbers k that have more solutions x to the equation A323410(x) = k than any smaller k.
%C A362183 Indices of records of A362181.
%C A362183 The corresponding numbers of solutions are 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 14, 16, 17, 21, ... (A362184).
%H A362183 Amiram Eldar, <a href="/A362183/b362183.txt">Table of n, a(n) for n = 1..96</a> (terms below 10^5)
%t A362183 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}]; s = {0}; solmax=1; Do[sol = solnum[[k]]; If[sol > solmax, solmax = sol; AppendTo[s, k]], {k, 2, max}]; s]
%Y A362183 Cf. A323410, A362181, A362184.
%Y A362183 The unitary version of A100827.
%Y A362183 Similar sequences: A097942, A361968.
%K A362183 nonn
%O A362183 1,2
%A A362183 _Amiram Eldar_, Apr 10 2023