![]() |
|
|
#190 |
|
Sep 2010
Portland, OR
22×3×31 Posts |
Edit (just missed the edit window): hmm, there are some mysterious gaps in my worker's logs, so maybe we were both adding factors at the same time... I picked up the downdriver at 219282.1969, but it dropped ~10 digits with 2^2 some time before that. Anyway, another one down!
|
|
|
|
|
|
#191 |
|
Sep 2010
Portland, OR
1011101002 Posts |
715590.2849 merges with 4116.3!
That's the first time I've ever actually watched a sequence end/merge. Cool. |
|
|
|
|
|
#192 |
|
Jul 2009
Aachen, Germany
41 Posts |
|
|
|
|
|
|
#195 | |
|
Noodles
"Mr. Tuch"
Dec 2007
Chennai, India
3·419 Posts |
Quote:
that being followed up by using that sequence 4788 as well? These are in run of downdrivers right at this moment, then. Thus, sequences 1920, 1992 right now currently are not at possession of drivers or guides at all, they are being stable at their present heights respectively. By the way, they are classic sequences, being that way up... Longest length sequences are that 389508, 8760, 1578, 195528 that are being running up right now... only actually indeed really Last fiddled with by Raman on 2011-05-07 at 13:01 |
|
|
|
|
|
|
#196 |
|
(loop (#_fork))
Feb 2006
Cambridge, England
144238 Posts |
Raman: The problem with downdrivers is that you can escape them by means other than running down and hitting a prime; for example on 80244 (which I've been running for the better part of a year), one of the downdrivers ends with
Code:
1662 331450237931703434054834110<27> = 2 · 5 · 317 · 325292423 · 321429050558521<15> 1663 267042244009442369003631362<27> = 2 · 133521122004721184501815681<27> 1664 133521122004721184501815684<27> = 2^2 · 7 · 13 · 313 · 125423 · 9343876023058469<16> |
|
|
|
|
|
#197 |
|
Noodles
"Mr. Tuch"
Dec 2007
Chennai, India
3·419 Posts |
I know that. It was just a joke.
If in any case that simply the number is Twice prime of form 1 (mod 4), only this case then downdriver comes to end. But still there is chance for sequence to terminate until some driver carries that sequence through long way. Anyway, if however if there is some sort of luck atleast, then that sequences 1134, 4788 (314718) could terminate up. Through this run itself? Let's see how long that downdriver progresses up. I looked up at that FactorDB - right now that sequence 1134 is making up with some rapid progress, right at this moment, thus That's why that type of sequence is being already classical enough. 1. Sum of proper factors can be greater, lesser, or equal to number, according to whether that number is being abundant, deficient, or perfect. Otherwise compare up with that Totient function, which is always being lesser than that original number itself 2. Different prime families 3. Powered by using that structure of guides, drivers, downdrivers with that final even to odd number transition itself 4. Powered by terminations in cycles such as perfect numbers, amicable or sociable, along with that prime endings, open end sequences, or that side sequence confluences Last fiddled with by Raman on 2011-05-08 at 16:48 |
|
|
|
|
|
#198 |
|
Sep 2010
Portland, OR
22·3·31 Posts |
The workers score! 683730 terminates in a nearly straight run down from 105 digits.
|
|
|
|
![]() |
Similar Threads
|
||||
| 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 |