Sequence: smallest number with exactly n divisors: Difference between revisions
Content added Content deleted
m (added whitespace, moved the ;See also: after the ;Related tasks:.) |
(Added Wren) |
||
Line 1,474: | Line 1,474: | ||
<pre>A005179(1..15) = |
<pre>A005179(1..15) = |
||
1 2 4 6 16 12 64 24 36 48 1024 60 4096 192 144</pre> |
1 2 4 6 16 12 64 24 36 48 1024 60 4096 192 144</pre> |
||
=={{header|Wren}}== |
|||
{{libheader|Wren-math}} |
|||
<lang ecmascript>import "/math" for Int |
|||
var limit = 22 |
|||
var numbers = List.filled(limit, 0) |
|||
var i = 1 |
|||
while (true) { |
|||
var nd = Int.divisors(i).count |
|||
if (nd <= limit && numbers[nd-1] == 0) { |
|||
numbers[nd-1] = i |
|||
if (numbers.all { |n| n > 0 }) break |
|||
} |
|||
i = i + 1 |
|||
} |
|||
System.print("The first %(limit) terms are:") |
|||
System.print(numbers)</lang> |
|||
{{out}} |
|||
<pre> |
|||
The first 22 terms are: |
|||
[1, 2, 4, 6, 16, 12, 64, 24, 36, 48, 1024, 60, 4096, 192, 144, 120, 65536, 180, 262144, 240, 576, 3072] |
|||
</pre> |
|||
=={{header|zkl}}== |
=={{header|zkl}}== |