login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A328522
Largest highly composite number that has n prime factors counted with multiplicity.
0
1, 2, 6, 12, 60, 180, 1260, 2520, 27720, 83160, 1081080, 3603600, 61261200, 698377680, 3491888400, 80313433200, 240940299600, 1686582097200, 48910880818800, 1516237305382800, 3032474610765600, 112201560598327200, 3066842656354276800, 131874234223233902400, 659371171116169512000, 30990445042459967064000
OFFSET
0,2
COMMENTS
These numbers are upper bounds on the largest term in A002182 that is not divisible by k for some k.
MATHEMATICA
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. *)
CROSSREFS
KEYWORD
nonn
AUTHOR
David A. Corneth, Jan 04 2020
STATUS
approved