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”).

A359957
a(n) is the smallest number with exactly n divisors that are greater than or equal to 6.
3
6, 12, 18, 24, 36, 48, 60, 72, 126, 192, 120, 168, 180, 252, 240, 336, 576, 3072, 360, 504, 1296, 900, 960, 1344, 720, 1008, 840, 1512, 4158, 27027, 1260, 2016, 9702, 63063, 1680, 3024, 2880, 4032, 15360, 3600, 7056, 94864, 2520, 5544, 6480, 9072, 61440, 86016
OFFSET
1,1
MATHEMATICA
Table[SelectFirst[Table[{n, Count[Divisors[n], _?(#>5&)]}, {n, 100000}], #[[2]]==k&], {k, 50}] [[;; , 1]] (* Harvey P. Dale, Jan 04 2024 *)
PROG
(PARI) a(n) = my(k=1); while (sumdiv(k, d, (d>=6)) != n, k++); k; \\ Michel Marcus, Jan 20 2023
CROSSREFS
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Jan 19 2023
STATUS
approved