Sequence: smallest number with exactly n divisors: Difference between revisions
Sequence: smallest number with exactly n divisors (view source)
Revision as of 16:02, 21 June 2021
, 2 years agono edit summary
m (→{{header|Phix}}: added syntax colouring the hard way) |
No edit summary |
||
Line 795:
1, 2, 4, 6, 16, 12, 64, 24, 36, 48, 1024, 60, 4096, 192, 144
</pre>
=={{header|Mathematica}} / {{header|Wolfram Language}}==
<lang Mathematica>Take[SplitBy[SortBy[{DivisorSigma[0, #], #} & /@ Range[100000], First], First][[All, 1]], 15] // Grid</lang>
{{out}}
<pre>1 1
2 2
3 4
4 6
5 16
6 12
7 64
8 24
9 36
10 48
11 1024
12 60
13 4096
14 192
15 144</pre>
=={{header|Nanoquery}}==
| |||