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 A377711 #7 Nov 04 2024 20:50:30
%S A377711 1,2,6,24,30,96,120,210,480,840,1920,2310,3360,9240,13440,30030,36960,
%T A377711 120120,147840,332640,480480,1330560,1921920,4324320,8168160,17297280,
%U A377711 30750720,32672640,73513440,155195040,294053760,522762240,620780160,1396755360,2646483840
%N A377711 Numbers that have a record number of (1+phi)-divisors (A061389).
%C A377711 Indices of records in A061389.
%C A377711 The corresponding record values are 1, 2, 4, 6, 8, 10, 12, 16, 20, 24, 28, 32, 40, 48, 56, ... (see the link for more values).
%H A377711 Amiram Eldar, <a href="/A377711/b377711.txt">Table of n, a(n) for n = 1..231</a>
%H A377711 Amiram Eldar, <a href="/A377711/a377711.txt">Table of n, a(n), A363825(a(n)) for n = 1..231</a>
%t A377711 f[p_, e_] := EulerPhi[e] + 1; d[1] = 1; d[n_] := Times @@ f @@@ FactorInteger[n]; v = Cases[Import["https://oeis.org/A025487/b025487.txt", "Table"], {_, _}][[;; , 2]]; seq = {}; dm = 0; Do[If[(dk = d[v[[k]]]) > dm, dm = dk; AppendTo[seq, v[[k]]]], {k, 1, Length[v]}]; seq
%Y A377711 Cf. A061389, A307004.
%Y A377711 Subsequence of A025487.
%K A377711 nonn
%O A377711 1,2
%A A377711 _Amiram Eldar_, Nov 04 2024