Sequence: smallest number with exactly n divisors: Difference between revisions
Sequence: smallest number with exactly n divisors (view source)
Revision as of 10:16, 10 April 2020
, 4 years ago→Functional Python: Refactored
(→{{header|Python}}: Added a functional composition in Python) |
m (→Functional Python: Refactored) |
||
Line 917:
def a005179():
'''Integer sequence: smallest number with exactly n divisors.'''
x for x in count(1)
if n == 1 + len(properDivisors(x))
) for n in count(1)
)
| |||