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 16:08, 21 June 2021
, 2 years agono edit summary
No edit summary |
|||
Line 719:
1 2 4 6 16 18 64 66 100 112 1024 1035 4096 4288 4624
</pre>
=={{header|Mathematica}} / {{header|Wolfram Language}}==
<lang Mathematica>res = {#, DivisorSigma[0, #]} & /@ Range[100000];
highest = 0;
filter = {};
Do[
If[r[[2]] == highest + 1,
AppendTo[filter, r[[1]]];
highest = r[[2]]
]
,
{r, res}
]
Take[filter, 15]</lang>
{{out}}
<pre>{1, 2, 4, 6, 16, 18, 64, 66, 100, 112, 1024, 1035, 4096, 4288, 4624}</pre>
=={{header|Nim}}==
| |||