Sequence: smallest number with exactly n divisors: Difference between revisions

m
typo
(→‎{{header|Perl}}: Move task entry)
m (typo)
Line 1:
{{draft task}}
 
Calculate the sequence where each term <strong>a<sub>n</sub></strong> is the '''smallest natural numbersnumber''' that has exactly '''n''' divisors.
 
;Task
10,339

edits