Sequence: smallest number with exactly n divisors: Difference between revisions
Content added Content deleted
No edit summary |
|||
Line 405:
<lang Maple>
with(NumberTheory):
countDivisors := proc(x::integer)
Line 417 ⟶ 416:
end proc:
y
▲ A := Append(A,sequenceValue(number)):
</lang>
{{out}}<pre>
</pre>
=={{header|Nim}}==
{{trans|Kotlin}}
|