Anonymous user
Sequence: smallest number with exactly n divisors: Difference between revisions
Sequence: smallest number with exactly n divisors (view source)
Revision as of 09:43, 16 September 2019
, 4 years agoAdded Python solution
(→{{header|Ruby}}: Removed copy paste error) |
(Added Python solution) |
||
Line 736:
1440 (complete fudge):1
</pre>
=={{header|Python}}==
<lang Python>
def divisors(n):
divs = [1]
for ii in range(2, int(n ** 0.5) + 3):
if n % ii == 0:
divs.append(ii)
divs.append(int(n / ii))
divs.append(n)
return list(set(divs))
def sequence(max_n=None):
n = 0
while True:
n += 1
ii = 0
if max_n is not None:
if n > max_n:
break
while True:
ii += 1
if len(divisors(ii)) == n:
yield ii
break
if __name__ == '__main__':
for item in sequence(15):
print(item)
</lang>
<b>Output:</b>
<lang Python>
1
2
4
6
16
12
64
24
36
48
1024
60
4096
192
144
</lang>
=={{header|REXX}}==
| |||