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

Content added Content deleted
No edit summary
Line 454:
println seq</lang>
{{out}}
<pre>The first 15 terms of the sequence are:
<pre>[1, 2, 4, 6, 16, 12, 64, 24, 36, 48, 1024, 60, 4096, 192, 144]</pre>
 
=={{header|Nim}}==
Retrieved from "https://rosettacode.org/wiki/Sequence:_smallest_number_with_exactly_n_divisors"