Sequence: smallest number with exactly n divisors: Difference between revisions
Content added Content deleted
Thundergnat (talk | contribs) (Move Perl 6 entry from Anti-primes plus task) |
Thundergnat (talk | contribs) m (Tidy heading) |
||
| Line 2: | Line 2: | ||
Calculate the sequence where each term <strong>a<sub>n</sub></strong> is the '''smallest natural numbers''' that has exactly '''n''' divisors. |
Calculate the sequence where each term <strong>a<sub>n</sub></strong> is the '''smallest natural numbers''' that has exactly '''n''' divisors. |
||
| ⚫ | |||
;Task |
;Task |
||
Show here, on this page, at least the first 15 terms of the sequence. |
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}}== |
=={{header|Perl 6}}== |
||