Sequence: smallest number with exactly n divisors: Difference between revisions
Sequence: smallest number with exactly n divisors (view source)
Revision as of 20:01, 13 November 2023
, 6 months agoAdd SETL
imported>Chinhouse No edit summary |
Not a robot (talk | contribs) (Add SETL) |
||
Line 2,302:
64 7560
</pre>
=={{header|SETL}}==
<syntaxhighlight lang="setl">program smallest_number_with_exactly_n_divisors;
print([a(n) : n in [1..15]]);
proc a(n);
return [i +:= 1 : until n = #[d : d in [1..i] | i mod d=0]](i);
end proc;
end program;</syntaxhighlight>
{{out}}
<pre>[1 2 4 6 16 12 64 24 36 48 1024 60 4096 192 144]</pre>
=={{header|Sidef}}==
| |||