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 A377710 #12 Jun 02 2025 15:28:24
%S A377710 1,2,6,24,30,120,210,840,2310,7560,9240,30030,83160,120120,510510,
%T A377710 1081080,1921920,2042040,9699690,18378360,32672640,38798760,223092870,
%U A377710 349188840,620780160,892371480,5587021440,6469693230,8031343320,14277943680,25878772920,128501493120
%N A377710 Numbers that have a record number of infinitary divisors that are exponentially odd numbers (A268335).
%C A377710 First differs from A322484 at n = 15.
%C A377710 Indices of records in A363825.
%C A377710 The corresponding record values are 1, 2, 4, 6, 8, 12, 16, 24, 32, 36, 48, 64, 72, 96, ... (see the link for more values).
%H A377710 Amiram Eldar, <a href="/A377710/b377710.txt">Table of n, a(n) for n = 1..139</a>
%H A377710 Amiram Eldar, <a href="/A377710/a377710_1.txt">Table of n, a(n), A363825(a(n)) for n = 1..139</a>
%t A377710 f[p_, e_] := 1 + If[OddQ[e], 2^DigitCount[e-1, 2, 1], 0]; 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 A377710 Cf. A268335, A363825, A322484.
%Y A377710 Subsequence of A025487.
%K A377710 nonn
%O A377710 1,2
%A A377710 _Amiram Eldar_, Nov 04 2024