Sequence: smallest number with exactly n divisors: Difference between revisions
Sequence: smallest number with exactly n divisors (view source)
Revision as of 22:31, 8 March 2021
, 3 years agoAdded 11l
Alextretyak (talk | contribs) (Added 11l) |
|||
Line 16:
:* [[oeis:A005179|OEIS:A005179]]
<br><br>
=={{header|11l}}==
{{trans|Python}}
<lang 11l>F divisors(n)
V divs = [1]
L(ii) 2 .< Int(n ^ 0.5) + 3
I n % ii == 0
divs.append(ii)
divs.append(Int(n / ii))
divs.append(n)
R Array(Set(divs))
F sequence(max_n)
V n = 0
[Int] r
L
n++
V ii = 0
I n > max_n
L.break
L
ii++
I divisors(ii).len == n
r.append(ii)
L.break
R r
L(item) sequence(15)
print(item)</lang>
{{out}}
<pre>
1
2
4
6
16
12
64
24
36
48
1024
60
4096
192
144
</pre>
=={{header|ALGOL 68}}==
| |||