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 A361968 #12 Apr 10 2023 05:14:29
%S A361968 1,6,8,12,24,48,96,120,144,240,480,576,720,1440,2880,4320,5760,8640,
%T A361968 10080,17280,20160,30240,34560,40320,60480,80640,120960,241920,362880,
%U A361968 483840,725760,967680,1209600,1451520,2177280,2419200,2903040,3628800,4354560,4838400
%N A361968 Unitary highly totient numbers: numbers k that have more solutions x to the equation uphi(x) = k than any smaller k, where uphi is the unitary totient function (A047994).
%C A361968 Indices of records of A361967.
%C A361968 The corresponding numbers of solutions are 2, 3, 4, 5, 8, 11, ... (A361971).
%H A361968 Amiram Eldar, <a href="/A361968/b361968.txt">Table of n, a(n) for n = 1..51</a>
%t A361968 solnum[n_] := Length[invUPhi[n]]; seq[kmax_] := Module[{s = {}, solmax=0}, Do[sol = solnum[k]; If[sol > solmax, solmax = sol; AppendTo[s, k]], {k, 1, kmax}]; s]; seq[10^5] (* using the function invUPhi from A361966 *)
%Y A361968 The unitary version of A097942.
%Y A361968 Cf. A047994, A135347, A347771, A361966, A361967, A361969, A361970, A361971.
%K A361968 nonn
%O A361968 1,2
%A A361968 _Amiram Eldar_, Apr 01 2023