Sequence: smallest number with exactly n divisors: Difference between revisions

Content added Content deleted
No edit summary
Line 405: Line 405:
<lang Maple>
<lang Maple>
with(NumberTheory):
with(NumberTheory):
with(ArrayTools):


countDivisors := proc(x::integer)
countDivisors := proc(x::integer)
Line 417: Line 416:
end proc:
end proc:


⚫
seq(sequenceValue(number), number = 1..15);
A := Array([]):
y
for number from 1 to 15 do
⚫
A := Append(A,sequenceValue(number)):
end:
print(A);

</lang>
</lang>
{{out}}<pre>
{{out}}<pre>
[1, 2, 4, 6, 16, 12, 64, 24, 36, 48, 1024, 60, 4096, 192, 144]
1, 2, 4, 6, 16, 12, 64, 24, 36, 48, 1024, 60, 4096, 192, 144
</pre>
</pre>

=={{header|Nim}}==
=={{header|Nim}}==
{{trans|Kotlin}}
{{trans|Kotlin}}
Retrieved from "https://rosettacode.org/wiki/Sequence:_smallest_number_with_exactly_n_divisors"