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 A322446 #52 Sep 02 2019 08:13:00
%S A322446 5,74,776,7770,77794,778337,7784712,77833385,778307928,7783494530
%N A322446 The number of solutions to usigma(k) > esigma(k) below 10^n, where usigma(k) is the sum of unitary divisors of k (A034448) and esigma(k) is the sum of exponential divisors of k (A051377).
%C A322446 The value of the asymptotic density of these solutions was asked in the paper by Trudgian.
%H A322446 Tim Trudgian, <a href="https://www.emis.de/journals/PIMB/111/16.html">The sum of the unitary divisor function</a>, Publications de l'Institut Mathématique (Beograd), Vol. 97, No. 111 (2015), pp. 175-180.
%F A322446 Lim_{n->oo} a(n)/10^n = 0.778...
%e A322446 Below 10^1 there are 5 numbers k with usigma(k) > esigma(k): 2, 3, 5, 6, and 7. Thus a(1) = 5.
%t A322446 aQ[1] = False; fun[p_, e_] := DivisorSum[e, p^# &]; aQ[n_] := Times @@ (1 + Power @@@ (f = FactorInteger[n])) > Times @@ (fun @@@ f); c = 0; k = 1; s = {}; Do[While[k < 10^n, If[aQ[k], c++]; k++]; AppendTo[s, c], {n, 1, 6}]; s
%Y A322446 Cf. A034448, A051377, A236474.
%K A322446 nonn,more
%O A322446 1,1
%A A322446 _Amiram Eldar_, Aug 28 2019