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 A308530 #9 Jun 07 2019 22:00:57
%S A308530 1,2,1,3,3,2,1,1,6,2,1,2,9,1,2,2,2,8,1,2,3,2,1,1,9,1,1,3,2,5,2,2,2,8,
%T A308530 1,2,1,6,3,6,2,2,1,6,1,1,1,5,1,3,8,1,2,5,3,10,1,2,2,4,2,3,8,2,1,6,4,
%U A308530 11,1,1,2,2,4,2,2,6,2,4,4,8,1,5,2,1,3,4
%N A308530 The number of largely composite numbers (A067128) having the same number of divisors as the n-th highly composite number A002182(n).
%H A308530 Michael De Vlieger, <a href="/A308530/b308530.txt">Table of n, a(n) for n = 1..783</a>
%e A308530 a(4) = 3 since there are 3 largely composite numbers with the same number of divisors as the 4th highly composite number 6: 6, 8, and 10.
%t A308530 s = {}; dm = 1; c = 0; Do[d = DivisorSigma[0, n]; If[d == dm, c++]; If[d > dm, dm = d; AppendTo[s, c]; c = 1], {n, 1, 10^8}]; s
%Y A308530 Cf. A000005, A002182, A067128.
%K A308530 nonn
%O A308530 1,2
%A A308530 _Amiram Eldar_, Jun 06 2019