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

Content added Content deleted

Inline

@@ Line 1: / Line 1: @@
 {{task}}
-Calculate the sequence where each term <strong>a<sub>n</sub></strong> is the '''smallest natural number''' that has exactly '''n''' divisors.
+Calculate the sequence where each term &nbsp; <strong>a<sub>n</sub></strong> &nbsp; is the '''smallest natural number''' that has exactly &nbsp; '''n''' &nbsp; divisors.
 ;Task
-Show here, on this page, at least the first '''15''' terms of the sequence.
+Show here, on this page, at least the first &nbsp;'''15'''&nbsp; terms of the sequence.
-;See also
+;Related tasks:
-:*[[oeis:A005179|OEIS:A005179]]
+:* [[Sequence: smallest number greater than previous term with exactly n divisors]]
+:* [[Sequence: nth number with exactly n divisors‎‎]]
-;Related tasks
+;See also:
-:*[[Sequence: smallest number greater than previous term with exactly n divisors]]
+:* [[oeis:A005179|OEIS:A005179]]
-:*[[Sequence: nth number with exactly n divisors‎‎]]
+<br><br>
 =={{header|ALGOL 68}}==