![]() |
![]() |
#969 |
May 2009
Russia, Moscow
5·7·73 Posts |
![]()
2380158 terminates
|
![]() |
![]() |
![]() |
#970 |
May 2009
Russia, Moscow
5×7×73 Posts |
![]()
2546760 terminates
|
![]() |
![]() |
![]() |
#971 |
Oct 2002
France
2028 Posts |
![]()
2466132 merges with sequence 2390294
|
![]() |
![]() |
![]() |
#972 |
Jun 2013
5316 Posts |
![]()
2583540 terminates
|
![]() |
![]() |
![]() |
#973 |
Nov 2011
24×3×5 Posts |
![]()
After a long delay of 8 months, a new marge under 1M is found by yafu@home:
377880:i3262 = 21768:i13 |
![]() |
![]() |
![]() |
#974 |
Oct 2002
France
13010 Posts |
![]()
1755864:2300 merges with 1402954:0.
|
![]() |
![]() |
![]() |
#975 |
May 2009
Russia, Moscow
5×7×73 Posts |
![]()
2175894 terminates.
My first termination in 2021. |
![]() |
![]() |
![]() |
#976 |
"Ed Hall"
Dec 2009
Adirondack Mtns
2×11×167 Posts |
![]()
I know the first couple posts have short lists of merges that were found, as do the subsequent posts, but is there an overall list of all the sequences that merge with earlier ones, such as <1M or <3M?
Something like: Code:
Sequence 276: 306:i1 merges with 276:i1 396:i0 merges with 276:i1 696:i0 merges with 276:i2 1104:i0 merges with 276:i3 1872:i0 merges with 276:i4 1876:i3 merges with 276:i10 . . . 311138:i11 merges with 276:i5 312866:i5 merges with 276:i13 314392:i8 merges with 276:i17 316810:i11 merges with 276:i5 317328:i23 merges with 276:i5 319738:i6 merges with 276:i13 . . . Sequence 564: 780:i0 merges with 564:i1 1314:i1 merges with 564:i2 1572:i0 merges with 564:i2 1842:i5 merges with 564:i4 1854:i4 merges with 564:i4 2124:i0 merges with 564:i3 . . . Code:
Sequence 276 merges: 306 396 696 1104 1872 1876 . . . 311138 312866 314392 316810 317328 319738 . . . Sequence 564 merges: 780 1314 1572 1842 1854 2124 . . . |
![]() |
![]() |
![]() |
#977 |
"Garambois Jean-Luc"
Oct 2011
France
2·3·7·13 Posts |
![]()
I might have something that is close to what you are looking for on my website here :
http://www.aliquotes.com/aliquote_base.htm#alibasefonda You can download "regina_file.tar.lzma" (size: 258.3MB) and you have this result not for n<3M, but for n<14M. But beware : all these calculations were only made up to 10^50. There are therefore several mergers that were not taken into account compared to what you would have if you scanned FactorDB. How to read this data ? General form of each row of this database : [n, a, b, c, d, e, f, g, h, i, j, k, l, m] n: starting integer from the aliquot sequence. a: relative integer which equals 1 if the sequence starting with n ends in 1, which equals 0 if the sequence is open-end, which is negative if the sequence falls on an aliquot chain of | a | links. c: if a is equal to 1, c is the prime number on which the starting sequence n has terminated. If a is 0, c is the smallest starting integer of the open-end sequence joined by the starting sequence n. Example with the following line : [306, 0, 144, 276, 2, 1, 0, 136, 2, 0, 0, 1.512782551, 0.8047493404, 2.872578052] This row of the table means for example that the sequence which starts with 306 is Open-end, because a = 0 and also that it merges with 276, because c = 276. (b, d, e, f, ... is of no interest to you). Edwin, don't hesitate if I can help you and answer your questions ... |
![]() |
![]() |
![]() |
#978 | |
"Ed Hall"
Dec 2009
Adirondack Mtns
2·11·167 Posts |
![]() Quote:
Thanks Jean-Luc! |
|
![]() |
![]() |
![]() |
#979 |
"Garambois Jean-Luc"
Oct 2011
France
2×3×7×13 Posts |
![]()
I'm really glad I helped you !
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Reserved for MF - Sequence 276 | kar_bon | Aliquot Sequences | 127 | 2020-12-17 10:05 |
Primes in n-fibonacci sequence and n-step fibonacci sequence | sweety439 | And now for something completely different | 17 | 2017-06-13 03:49 |
Figuring Out Sequence Merges | Jayder | Aliquot Sequences | 13 | 2014-05-30 05:11 |
Novice Questions About Merges | EdH | Aliquot Sequences | 4 | 2010-04-13 19:43 |
A New Sequence | devarajkandadai | Math | 3 | 2007-03-20 19:43 |