Anonymous user
Sequence: smallest number greater than previous term with exactly n divisors: Difference between revisions
Sequence: smallest number greater than previous term with exactly n divisors (view source)
Revision as of 09:31, 12 April 2019
, 5 years agoadded an HTML comment and whitespace to the task's preamble.
m (→{{header|Pascal}}: uses math for DivMod and added TryItOnline Link and their timings) |
m (added an HTML comment and whitespace to the task's preamble.) |
||
Line 1:
<!-- This Rosetta Code task previously was named Anti-prime Plus
before it was renamed and split into three different tasks. !-->
{{draft task}}
{{Clarified-review}}
{{Alertbox|pink|NOTE: Task has been split into multiple tasks. <br> Please check that the entries are correct with the changed task description and fix / move accordingly}}
Calculate the sequence where each term <strong>a<sub>n</sub></strong> is the '''smallest natural number''' greater than the previous term, that has exactly '''n''' divisors.
;Task▼
▲;Task
Show here, on this page, at least the first '''15''' terms of the sequence.
;See also
:* [[oeis:A069654|OEIS:A069654]]▼
▲:*[[oeis:A069654|OEIS:A069654]]
;Related tasks
:* [[Sequence:
<br><br>
▲:*[[Sequence: nth number with exactly n divisors]]
=={{header|ALGOL 68}}==
| |||