Sequence: smallest number with exactly n divisors: Difference between revisions
Sequence: smallest number with exactly n divisors (view source)
Revision as of 08:53, 3 June 2021
, 3 years agoadded Quackery.
(→{{header|Sidef}}: added a more efficient solution) |
(added Quackery.) |
||
Line 1,337:
{{Out}}
<pre>[1, 2, 4, 6, 16, 12, 64, 24, 36, 48, 1024, 60, 4096, 192, 144]</pre>
=={{header|Quackery}}==
<code>factors</code> is defined at [http://rosettacode.org/wiki/Factors_of_an_integer#Quackery Factors of an integer].
<lang Quackery> [ 0
[ 1+ 2dup
factors size =
until ]
nip ] is nfactors ( n --> n )
15 times [ i^ 1+ nfactors echo sp ]</lang>
{{out}}
<pre>1 2 4 6 16 12 64 24 36 48 1024 60 4096 192 144</pre>
=={{header|Raku}}==
| |||