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 A328522 #17 Apr 10 2020 15:18:38
%S A328522 1,2,6,12,60,180,1260,2520,27720,83160,1081080,3603600,61261200,
%T A328522 698377680,3491888400,80313433200,240940299600,1686582097200,
%U A328522 48910880818800,1516237305382800,3032474610765600,112201560598327200,3066842656354276800,131874234223233902400,659371171116169512000,30990445042459967064000
%N A328522 Largest highly composite number that has n prime factors counted with multiplicity.
%C A328522 These numbers are upper bounds on the largest term in A002182 that is not divisible by k for some k.
%t A328522 With[{s = Take[Import["https://oeis.org/b002182.txt", "Data"][[All, -1]], 240]}, Drop[TakeWhile[#, IntegerQ], -6] &@ Table[s[[Lookup[#, n][[-1]] ]], {n, 0, Max@ Keys@ #}] &@ PositionIndex[Map[PrimeOmega, s]]] (* _Michael De Vlieger_, Jan 19 2020, using b-file at A002182. Caution: ensure full population of a given value of bigomega by extending scope beyond the desired number of terms. *)
%Y A328522 Cf. A001222, A002182, A112778, A328521.
%K A328522 nonn
%O A328522 0,2
%A A328522 _David A. Corneth_, Jan 04 2020