Jump to content

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

Sequence: smallest number with exactly n divisors (view source)

Revision as of 12:53, 8 January 2020

62 bytes removed ,  4 years ago
→‎{{header|Maple}}
No edit summary
Line 405:
<lang Maple>
with(NumberTheory):
with(ArrayTools):
 
countDivisors := proc(x::integer)
Line 417 ⟶ 416:
end proc:
 
A := Appendseq(A,sequenceValue(number), number = 1..15):;▼
A := Array([]):
y
for number from 1 to 15 do
▲ A := Append(A,sequenceValue(number)):
end:
print(A);
 
</lang>
{{out}}<pre>
[ 1, 2, 4, 6, 16, 12, 64, 24, 36, 48, 1024, 60, 4096, 192, 144]
</pre>
 
=={{header|Nim}}==
{{trans|Kotlin}}
Anonymous user
Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/289864"
Cookies help us deliver our services. By using our services, you agree to our use of cookies.
More information