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 A377708 #8 Nov 04 2024 20:49:35
%S A377708 1,2,4,6,12,24,36,60,120,180,360,840,1260,2520,6300,7560,12600,27720,
%T A377708 69300,83160,138600,360360,900900,1081080,1801800,5405400,12612600,
%U A377708 18378360,30630600,91891800,214414200,349188840,581981400,1745944200,4073869800,8031343320,12221609400
%N A377708 Numbers k that have a record number of divisors d such that gcd(d, k/d) is an exponentially odd number (A268335).
%C A377708 First differs from A365681 at n = 22.
%C A377708 First differs from A377140 at n = 95.
%C A377708 Indices of records in A365173.
%C A377708 The corresponding record values are 1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 32, 36, 48, 54, ... (see the link for more values).
%H A377708 Amiram Eldar, <a href="/A377708/b377708.txt">Table of n, a(n) for n = 1..164</a>
%H A377708 Amiram Eldar, <a href="/A377708/a377708.txt">Table of n, a(n), A365173(a(n)) for n = 1..164</a>
%t A377708 f[p_, e_] := Floor[(e + 5)/4] + Floor[(e + 6)/4]; 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 A377708 Cf. A268335, A365173, A365681, A377140.
%Y A377708 Subsequence of A025487.
%K A377708 nonn
%O A377708 1,2
%A A377708 _Amiram Eldar_, Nov 04 2024