17 lines
482 B
Plaintext
17 lines
482 B
Plaintext
Calculate the sequence where each term <strong>a<sub>n</sub></strong> is the '''smallest natural number''' that has exactly '''n''' divisors.
|
||
|
||
|
||
;Task
|
||
Show here, on this page, at least the first '''15''' terms of the sequence.
|
||
|
||
|
||
;Related tasks:
|
||
:* [[Sequence: smallest number greater than previous term with exactly n divisors]]
|
||
:* [[Sequence: nth number with exactly n divisors]]
|
||
|
||
|
||
;See also:
|
||
:* [[oeis:A005179|OEIS:A005179]]
|
||
<br><br>
|
||
|