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 A363330 #9 May 28 2023 20:50:13
%S A363330 1,8,128,216,3456,27000,279936,432000,9261000,34992000,148176000,
%T A363330 8957952000,12002256000,197222256000,3072577536000,7501410000000,
%U A363330 15975002736000,433297296432000,1920360960000000,4089600700416000,9984376710000000,35097081010992000,2128789617370416000
%N A363330 Numbers with a record number of divisors that are both coreful and infinitary.
%C A363330 Indices of records in A363329.
%C A363330 The corresponding record values are 1, 3, 7, 9, 21, 27, 49, 63, 81, 147, 189, 315, ... (see the link for more values).
%H A363330 Amiram Eldar, <a href="/A363330/b363330.txt">Table of n, a(n) for n = 1..64</a>
%H A363330 Amiram Eldar, <a href="/A363330/a363330.txt">Table of n, a(n), A363329(a(n)) for n = 1..64</a>
%t A363330 f[p_, e_] := 2^DigitCount[e, 2, 1] - 1; d[1] = 1; d[n_] := Times @@ f @@@ FactorInteger[n];
%t A363330 v = Cases[Import["https://oeis.org/A025487/b025487.txt", "Table"], {_, _}][[;; , 2]];
%t A363330 seq = {}; dm = 0; Do[If[(dk = d[v[[k]]]) > dm, dm = dk; AppendTo[seq, v[[k]]]], {k, 1, Length[v]}]; seq
%Y A363330 Cf. A363329.
%Y A363330 Subsequence of A025487.
%Y A363330 Similar sequences: A005934, A037992.
%K A363330 nonn
%O A363330 1,2
%A A363330 _Amiram Eldar_, May 28 2023