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 12:34, 15 April 2022
, 2 years agoAdded Arturo implementation
m (→{{header|Phix}}: added limit of 32 results) |
Drkameleon (talk | contribs) (Added Arturo implementation) |
||
Line 224:
The first 15 terms of the sequence are: 1 2 4 6 16 18 64 66 100 112 1024 1035 4096 4288 4624
</pre>
=={{header|Arturo}}==
<lang rebol>i: new 0
next: new 1
MAX: 15
while [next =< MAX][
if next = size factors i [
prints ~"|i| "
inc 'next
]
inc 'i
]
print ""</lang>
{{out}}
<pre>1 2 4 6 16 18 64 66 100 112 1024 1035 4096 4288 4624</pre>
=={{header|AutoHotkey}}==
| |||