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 13:57, 28 March 2022
, 2 years agoAdded Quackery optimised version
(Added XPL0 example.) |
(Added Quackery optimised version) |
||
Line 1,205:
4624
</lang>
=={{header|Quackery}}==
<code>factors</code> is defined at [[Factors of an integer#Quackery]].
<lang Quackery> [ stack ] is terms ( --> s )
[ temp put
[] terms put
0 1
[ dip 1+
over factors size
over = if
[ over
terms take
swap join
terms put
1+ ]
terms share size
temp share = until ]
terms take
temp release
dip 2drop ] is task ( n --> [ )
15 task echo</lang>
{{out}}
<pre>[ 1 2 4 6 16 18 64 66 100 112 1024 1035 4096 4288 4624 ]</pre>
=={{header|R}}==
| |||