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 A363333 #9 May 28 2023 20:50:46
%S A363333 1,8,32,128,216,864,3456,7776,13824,31104,108000,279936,432000,972000,
%T A363333 1728000,3888000,15552000,34992000,62208000,97200000,139968000,
%U A363333 248832000,333396000,559872000,592704000,874800000,1333584000,5334336000,12002256000,21337344000,33339600000
%N A363333 Numbers with a record number of divisors that are both coreful and bi-unitary.
%C A363333 Indices of records in A363332.
%C A363333 The corresponding record values are 1, 3, 5, 7, 9, 15, 21, 25, 27, 35, 45, 49, 63, 75, 81, ... (see the link for more values).
%H A363333 Amiram Eldar, <a href="/A363333/b363333.txt">Table of n, a(n) for n = 1..261</a>
%H A363333 Amiram Eldar, <a href="/A363333/a363333.txt">Table of n, a(n), A363332(a(n)) for n = 1..261</a>
%t A363333 f[p_, e_] := If[OddQ[e], e, e - 1]; d[1] = 1; d[n_] := Times @@ (f @@@ FactorInteger[n]); Array[a, 120]
%t A363333 v = Cases[Import["https://oeis.org/A025487/b025487.txt", "Table"], {_, _}][[;; , 2]];
%t A363333 seq = {}; dm = 0; Do[If[(dk = d[v[[k]]]) > dm, dm = dk; AppendTo[seq, v[[k]]]], {k, 1, Length[v]}]; seq
%Y A363333 Cf. A363332.
%Y A363333 Subsequence of A025487.
%Y A363333 Similar sequences: A005934, A293185.
%K A363333 nonn
%O A363333 1,2
%A A363333 _Amiram Eldar_, May 28 2023