Sequence: smallest number with exactly n divisors: Difference between revisions
Sequence: smallest number with exactly n divisors (view source)
Revision as of 16:02, 11 April 2019
, 5 years agoTidy heading
Thundergnat (talk | contribs) (Move Perl 6 entry from Anti-primes plus task) |
Thundergnat (talk | contribs) m (Tidy heading) |
||
Line 2:
Calculate the sequence where each term <strong>a<sub>n</sub></strong> is the '''smallest natural numbers''' that has exactly '''n''' divisors.
See: [[oeis:A005179|OEIS:A005179]]▼
;Task
Show here, on this page, at least the first '''15''' terms of the sequence.
;See also
;Related tasks
:*[[Sequence: smallest number greater than previous term with exactly n divisors]]
:*[[Sequence: nth number with exactly n divisors]]
=={{header|Perl 6}}==
| |||