Sequence: nth number with exactly n divisors: Difference between revisions
Sequence: nth number with exactly n divisors (view source)
Revision as of 14:12, 8 March 2021
, 3 years ago→{{header|Sidef}}
(Added Wren) |
|||
Line 1,386:
if idx//5==0 then say; return /*display a separator for the eyeballs.*/</lang>
{{out|output|text= is identical to the 1<sup>st</sup> REXX version.}} <br><br>
=={{header|Ring}}==
<lang ring>
load "stdlib.ring"
num = 0
limit = 22563490300366186081
see "working..." + nl
see "the first 15 terms of the sequence are:" + nl
for n = 1 to 15
num = 0
for m = 1 to limit
pnum = 0
for p = 1 to limit
if (m % p = 0)
pnum = pnum + 1
ok
next
if pnum = n
num = num + 1
if num = n
see "" + n + ": " + m + " " + nl
exit
ok
ok
next
next
see nl + "done..." + nl
</lang>
{{out}}
<pre>
working...
the first 15 terms of the sequence are:
1 : 1
2 : 3
3 : 25
4 : 14
5 : 14641
6 : 44
7 : 24137569
8 : 70
9 : 1089
10 : 405
11 : 819628286980801
12 : 160
13 : 22563490300366186081
14 : 2752
15 : 9801
done...
</pre>
=={{header|Sidef}}==
| |||