Sequence: smallest number with exactly n divisors

From Rosetta Code
Revision as of 15:16, 11 April 2019 by Thundergnat (talk | contribs) (Draft task A005179, split off from anti-primes plus)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Sequence: smallest number with exactly n divisors is a draft programming task. It is not yet considered ready to be promoted as a complete task, for reasons that should be found in its talk page.

Calculate the sequence where each term an is the smallest natural numbers that has exactly n divisors.

See: OEIS:A005179

Task

Show here, on this page, at least the first 15 terms of the sequence.

Retrieved from "https://rosettacode.org/wiki/Sequence:_smallest_number_with_exactly_n_divisors?oldid=289820"