Sequence: smallest number with exactly n divisors: Difference between revisions
Sequence: smallest number with exactly n divisors (view source)
Revision as of 14:17, 10 April 2020
, 4 years ago→{{header|Haskell}}: Pruned a little noise
m (→Functional Python: Refactored) |
m (→{{header|Haskell}}: Pruned a little noise) |
||
Line 317:
a005179 =
catMaybes $
(\n -> find (
properDivisors :: Int -> [Int]
Line 332:
{{Out}}
<pre>[1,2,4,6,16,12,64,24,36,48,1024,60,4096,192,144]</pre>
=={{header|J}}==
| |||