Anonymous user
Sequence: smallest number with exactly n divisors: Difference between revisions
Sequence: smallest number with exactly n divisors (view source)
Revision as of 16:48, 19 July 2020
, 3 years agoadded whitespace, moved the ;See also: after the ;Related tasks:.
m (→{{header|REXX}}: added whitespace.) |
m (added whitespace, moved the ;See also: after the ;Related tasks:.) |
||
Line 1:
{{task}}
Calculate the sequence where each term <strong>a<sub>n</sub></strong> is the '''smallest natural number''' that has exactly '''n''' divisors.
;Task
Show here, on this page, at least the first '''15''' terms of the sequence.
;See also▼
;Related tasks:▼
:*[[oeis:A005179|OEIS:A005179]]▼
:* [[Sequence: smallest number greater than previous term with exactly n divisors]]▼
:* [[Sequence: nth number with exactly n divisors]]▼
▲;Related tasks
▲;See also:
▲:*[[Sequence: smallest number greater than previous term with exactly n divisors]]
▲:* [[oeis:A005179|OEIS:A005179]]
▲:*[[Sequence: nth number with exactly n divisors]]
<br><br>
=={{header|ALGOL 68}}==
| |||