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 A349608 #10 Nov 28 2021 02:55:23
%S A349608 1,2,2,3,4,4,4,6,5,6,6,8,8,9,8,10,12,12,12,12,12,12,16,15,16,18,16,16,
%T A349608 20,18,18,20,24,24,24,24,24,24,24,24,30,32,28,30,32,30,36,36,32,30,40,
%U A349608 36,32,36,36,40,36,36,48,42,40,40,40,48,45,48,48,48,48
%N A349608 a(n) is the number of divisors of the n-th highly abundant number (A002093).
%H A349608 Amiram Eldar, <a href="/A349608/b349608.txt">Table of n, a(n) for n = 1..10000</a>
%F A349608 a(n) = A000005(A002093(n)).
%e A349608 a(1) = A000005(A002093(1)) = A000005(1) = 1.
%e A349608 a(10) = A000005(A002093(10)) = A000005(18) = 6.
%t A349608 seq = {}; sm = 0; Do[s = DivisorSigma[1, n]; If[s > sm, sm = s; AppendTo[seq, DivisorSigma[0, n]]], {n, 1, 10^4}]; seq
%Y A349608 Cf. A000005, A002093, A034885, A349607.
%K A349608 nonn
%O A349608 1,2
%A A349608 _Amiram Eldar_, Nov 23 2021