20210804, 07:42  #1277  
"99(4^34019)99 palind"
Nov 2016
(P^81993)SZ base 36
2^{2}×761 Posts 
Quote:
I am curious of which number is the smallest odd number whose Aliquot sequence has not yet been fully determined? 1521 = 39^2 is the smallest odd number with long Aliquot sequence. Edit: I have found it with my program, it is 3025 = 55^2 Last fiddled with by sweety439 on 20210804 at 07:48 

20210804, 13:34  #1278 
Aug 2020
79*6581e4;3*2539e3
2·199 Posts 
All odd bases with even exponent should switch to an even number with the second term. It would be interesting to see which odd number that isn't a square is of yet open ended.

20210804, 23:47  #1279 
"Alexander"
Nov 2008
The Alamo City
2×379 Posts 
276 and 552 are initialized. 564 is next, where a nontrivial termination is already known (564^5). I'll see if there are any other notable sequences.

20210805, 04:21  #1280 
"99(4^34019)99 palind"
Nov 2016
(P^81993)SZ base 36
2^{2}·761 Posts 
Completed 120^7 at 265 bits (120^2 terminates at 36781, 120^4 terminates at 2643497, 120^6 terminates at 103078882663, 120^8 terminates at 381673, 120^3 and 120^5 merges with other sequences), I will stop only if the number is > 2^256
Now reserving 120^9 
20210805, 07:00  #1281  
"Garambois JeanLuc"
Oct 2011
France
7·97 Posts 
Quote:
Let me know as soon as I can add these bases to the page. Many thanks. This data will be taken into account in the next update. Quote:
I will add these bases in the next update. Quote:
It is not necessary to report all the steps in the initialization of the base 120. Let me know when you have calculated all the trivial sequences (even powers) up to 120^56 and for the nontrivial (odd powers) up to 120^57. OK for term size up to 2^256. 

20210805, 07:43  #1282  
"Garambois JeanLuc"
Oct 2011
France
7·97 Posts 
Quote:
We had worked this way at the beginning of the project, but at a 120 digit limit. It was sometimes laborious, because we always had to go and look at the limit exponent we had to work with. Especially for yoyo, which reserves bases by large packages. So I simplified it by putting round numbers in stages for the limit exponents. And that turned out to be more convenient. Moreover, for the limit exponents, I tried to find a compromise so that the number of digits in the last sequence of a base is not too big. I know that no one will calculate sequences of more than 160 digits, at least not until the distant future ! But if other contributors want me to adopt the old method again, I will : all limit exponents for a base calculated so that the first term of the sequence has 200 digits. Current state of opinion :  Alexander : limit exponent for each base calculated so that the first term of the last sequence of a base has 200 digits  Yoyo : leave everything as it is now  Myself : leave everything as it is now except for b bases such as 280<b<1000 : extend to exponent 70 Quote:
But I'm really reluctant to create a new category whose bases could then be removed. But maybe I'm wrong ? Again, let's make democracy work. If other contributors give their opinion on the subject, we will make a decision based on the majority that will make it easier for as many people as possible, it seems fair. Current state of opinion :  Alexander : add a category including the OpenEnd sequences of the main project  Myself : do not add it On the other hand, if the calculations show that there are really special things happening for these bases, or on the contrary, that nothing is happening at all, this can also make us change our opinion... Quote:
Sorry, this will be fixed in the next update. 

20210805, 12:43  #1283 
Sep 2008
Kansas
11·313 Posts 
Base 51 can be added at the next update.

20210805, 13:55  #1284 
"Ed Hall"
Dec 2009
Adirondack Mtns
7·571 Posts 

20210805, 15:05  #1285 
"99(4^34019)99 palind"
Nov 2016
(P^81993)SZ base 36
BE4_{16} Posts 

20210805, 16:18  #1286  
Apr 2020
2^{2}·3·41 Posts 
Quote:


20210805, 20:37  #1287 
"Curtis"
Feb 2005
Riverside, CA
7·23·31 Posts 
Welcome to Sweety's idea of contributing work. More time is spent writing posts than computing.
Sweety You don't need to tell us what happens to each sequence. Just tell us when you're done with the entire base, and the data will all be imported. Cofactors of C100 or terms of 120 digits are more reasonable bounds than 256 bits; Yafu's quadratic sieve is enough firepower for those bounds, so aliqueit can still run without extra interaction on your part. I hope it's not your goal to repeat your CRUS performance with Gary, computing so little that the admin ends up preferring that you hadn't joined at all. 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Broken aliquot sequences  fivemack  FactorDB  46  20210221 10:46 
Broken aliquot sequences  schickel  FactorDB  18  20130612 16:09 
A new theorem about aliquot sequences  garambois  Aliquot Sequences  34  20120610 21:53 
poaching aliquot sequences...  Andi47  FactorDB  21  20111229 21:11 
New article on aliquot sequences  schickel  mersennewiki  0  20081230 07:07 