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 A365681 #8 Sep 15 2023 16:25:07
%S A365681 1,2,4,6,12,24,36,60,120,180,360,840,1260,2520,6300,7560,12600,27720,
%T A365681 69300,83160,138600,332640,360360,900900,1081080,1801800,4324320,
%U A365681 5405400,12612600,17297280,18378360,30630600,73513440,86486400,91891800,214414200,294053760
%N A365681 Numbers with a record number of exponentially squarefree divisors.
%C A365681 Indices of records of A365680.
%C A365681 The corresponding record values are 1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 32, 36, 48, 54, 64, 72, 96, ... (see the link for more values).
%H A365681 Amiram Eldar, <a href="/A365681/b365681.txt">Table of n, a(n) for n = 1..255</a>
%H A365681 Amiram Eldar, <a href="/A365681/a365681.txt">Table of n, a(n), A365680(a(n)) for n = 1..255</a>
%t A365681 f[p_, e_] := Count[Range[e], _?SquareFreeQ] + 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 A365681 Cf. A365680.
%Y A365681 Subsequence of A025487.
%Y A365681 Similar sequences: A306736, A307845, A318278.
%K A365681 nonn
%O A365681 1,2
%A A365681 _Amiram Eldar_, Sep 15 2023