Sequence: smallest number greater than previous term with exactly n divisors: Difference between revisions
Content added Content deleted
m (→{{header|Phix}}: syntax coloured) |
m (→{{header|Phix}}: added limit of 32 results) |
||
Line 998: | Line 998: | ||
<pre> |
<pre> |
||
The first 15 terms are: {1,2,4,6,16,18,64,66,100,112,1024,1035,4096,4288,4624} |
The first 15 terms are: {1,2,4,6,16,18,64,66,100,112,1024,1035,4096,4288,4624} |
||
</pre> |
|||
You can raise the limit to 32, the 25th takes about 4s but the rest are all near-instant, however I lost patience waiting for the 33rd.<br> |
|||
<small>(The last two trailing .0 just mean "not a 31-bit integer" and don't appear when run on 64 bit.)</small> |
|||
<pre> |
|||
The first 32 terms are: {1,2,4,6,16,18,64,66,100,112,1024,1035,4096,4288,4624, |
|||
4632,65536,65572,262144,262192,263169,269312,4194304, |
|||
4194306,4477456,4493312,4498641,4498752,268435456, |
|||
268437200,1073741824.0,1073741830.0} |
|||
</pre> |
</pre> |
||