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 A336671 #10 Jul 30 2020 03:39:34
%S A336671 30030,39270,43890,46410,51870,62790,67830,79170,82110,91770,103530,
%T A336671 161070,166530,709170,718410,723030,732270,764610,778470,801570,
%U A336671 806190,815430,829290,833910,847770,861630,875490,884730,155934030,264670770,1234205070,1448478570
%N A336671 Unitary barely 3-abundant: numbers m such that 3 < usigma(m)/m < usigma(k)/k for all numbers k < m, where usigma is the sum of unitary divisors function (A034448).
%C A336671 The corresponding values of usigma(m)/m are 3.222..., 3.168...., 3.149..., 3.127..., 3.109..., ...
%H A336671 Amiram Eldar, <a href="/A336671/b336671.txt">Table of n, a(n) for n = 1..36</a>
%t A336671 usigma[1] = 1; usigma[n_] := Times @@ (1 + Power @@@ FactorInteger[n]); s = {}; rm = 4; Do[r = usigma[n]/n; If[r > 3 && r < rm, rm = r; AppendTo[s, n]], {n, 1, 10^5}]; s
%Y A336671 The unitary version of A259312.
%Y A336671 Subsequence of A285615.
%Y A336671 Cf. A034448, A034683, A302570, A336672.
%K A336671 nonn
%O A336671 1,1
%A A336671 _Amiram Eldar_, Jul 29 2020