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 A325202 #19 Sep 07 2019 08:13:39
%S A325202 0,1,2,3,4,5,6,7,8,9,10,11,13,14,15,16,17,21,24,26,28,31,33,35,37,38,
%T A325202 45,49,56,60,63,64,65,72,73,81,83,94,100,105,121,138,145,149,169,175,
%U A325202 176,180,182,202,210,234,236,256,285,288,306,319,343,347,362,382
%N A325202 Number of times that A325177(n) occurs in the sum of proper unitary divisors function (A034460).
%C A325202 The unitary version of A238896.
%F A325202 a(n) = A324938(A325177(n)).
%t A325202 us[1] = 0; us[n_] := Times @@ (1 + Power @@@ FactorInteger[n]) - n; m = 300; v = Table[0, {m}]; Do[u = us[k]; If[2 <= u <= m, v[[u]]++], {k, 1, m^2}]; s = {}; vm = -1; Do[If[v[[k]] > vm, vm = v[[k]]; AppendTo[s, vm]], {k, 2, m}]; s
%Y A325202 Cf. A034448, A034460, A063948, A238896, A324938, A325177.
%K A325202 nonn
%O A325202 1,3
%A A325202 _Amiram Eldar_, Sep 05 2019