mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 5 of 5
Search took 0.01 seconds.
Search: Posts Made By: rodac
Forum: Aliquot Sequences 2009-11-13, 14:49
Replies: 255
Views: 50,417
Posted By rodac
I think it's possible to find others 2^8191...

I think it's possible to find others 2^8191 escapes...
Take odd multiples of 2^12 * 8191 (who are not already computed) and run them with aliqueit...

I have put the sequence 1576865792 into the...
Forum: Aliquot Sequences 2009-11-13, 14:22
Replies: 255
Views: 50,417
Posted By rodac
I have found that in the sequence 1576865792 (a...

I have found that in the sequence 1576865792 (a multiple of 2^12 * M13)

246 . 95615155791455932871346912618444108138195554304 = 2^12 * 3^4 * 2879 * 8191 * 62299 * 8374739 * 29587193 *...
Forum: Aliquot Sequences 2009-11-09, 23:33
Replies: 255
Views: 50,417
Posted By rodac
267240 has probably a record of fastest...

267240 has probably a record of fastest increasing; reaching:

80 digits at i: 192
90 digits at i: 217
100 digits at i: 248
110 digits at i: 279
115 digits at i: 294

... and why not 120...
Forum: Aliquot Sequences 2009-10-11, 13:01
Replies: 255
Views: 50,417
Posted By rodac
Hello another recreational class records ...

Hello

another recreational class records

I am looking for the longest sequences who are reaching n digits
My list is uncomplete, there are certainly longer sequences fort a part of them.

an...
Forum: Aliquot Sequences 2009-09-20, 00:15
Replies: 255
Views: 50,417
Posted By rodac
Hello :smile: I have seen that the...

Hello :smile:

I have seen that the sequences 102072 and 84822 merge on the high number 8001424452.

Is it the highest merge or do higher merges exist for the sequences beginning under 10^6 ? ...
Showing results 1 to 5 of 5

 
All times are UTC. The time now is 09:30.


Sun Aug 1 09:30:24 UTC 2021 up 9 days, 3:59, 0 users, load averages: 2.43, 2.50, 2.39

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.