OEIS/3x+1 Levels
< previous part: OEIS/3x+1_Connectivity ^ up: OEIS/3x+1_Problem
Attachment rules
The following table (T4) tells the computation rules for the target position, depending on the modularity condition of the source segment, and listed by increasing column number. We identify and denote these attachment rules by the target column number. We show the first segments (their left side) for k = 0, 1, 2, 3.
T4 shows the nodes and formulas in uncompressed form, but the formulas for the compressed form can easily be derived by mapping 7*i-2 to i.
| Rule / column |
Source segments |
Condition / remaining |
First source segments |
Target segments |
First target segments |
Dir. |
|---|---|---|---|---|---|---|
| 5 | 6(20(4k + 3)) - 2 | 0 mod 8 2, 4, 6 mod 8 |
16, 40, 64, 88 | 6(30k + 1 ) - 2 | 4, 10, 16, 22 | < |
| 6 | 6(20(4k + 1)) - 2 | 4 mod 8 2, 6, 10, 14 mod 16 |
4, 28, 52, 76 | 6(31k + 1) - 2 | 4, 22, 40, 58 | < |
| 9 | 6(21(4k + 1)) - 2 | 10 mod 16 2, 6, 14 mod 16 |
10, 58, 106, 154 | 6(31k + 1) - 2 | 4, 22, 40, 58 | < |
| 10 | 6(21(4k + 3)) - 2 | 2 mod 16 6, 14, 22, 30 mod 32 |
34, 82, 130, 178 | 6(32k + 7) - 2 | 40, 94, 148, 202 | > |
| 13 | 6(22(4k + 3)) - 2 | 6 mod 32 14, 22, 30 mod 32 |
70, 166, 262, 358 | 6(32k + 7) - 2 | 40, 94, 148, 202 | < |
| 14 | 6(22(4k + 1)) - 2 | 22 mod 32 14, 30, 46, 62 mod 64 |
22, 118, 214, 310 | 6(33k + 7) - 2 | 40, 202, 364, 526 | > |
| 17 | 6(23(4k + 1)) - 2 | 46 mod 64 14, 30, 62 mod 64 |
46, 238, 430, 622 | 6(33k + 7) - 2 | 40, 202, 364, 526 | < |
| 18 | 6(23(4k + 3)) - 2 | 14 mod 64 30, 62, 94, 126 mod 128 |
142, 334, 526, 718 | 6(34k + 61) - 2 | 364, 850, 1336, 1822 | > |
| 21 | 6(24(4k + 3)) - 2 | 30 mod 128 62, 94, 126 mod 128 |
286, 670, 1054, 1438 | 6(34k + 61) - 2 | 364, 850, 1336, 1822 | > |
| 22 | 6(24(4k + 1)) - 2 | 94 mod 128 62, 126, 190, 254 mod 256 |
94, 478, 862, 1246 | 6(35k + 61) - 2 | 364, 1822, 3280, 4738 | > |
| ... | ... | ... | ... | ... | ... | ... |
Enrooted and disrooted sets
We want to combine all segments such that they form a single tree with root 4 (or 1 in the compressed case). We define two sets:
- The enrooted set E enumerates all segments for which it is still unknown how they should be attached to other segments. E contains all segments from the segment directory in the beginning.
- The disrooted set D enumerates all segments which have a known attachment rule, target segment and column where they can be attached. D is empty in the beginning.
We now proceed by describing steps which attach some subset of E to another subset of D. Each step will reduce the number of segments remaining in E. E in infinite, so such reductions may not help much at first sight. Our goal is, however, to end up with subsets in E which can be "summed up", that is we want to find chains of compressed segments c1 = 4, ci1, ci2, ci3, ... where any ci can be attached to the previous one.
Attachment of short segments
A compressed segement is short if it is built by a µµ operation only (they have index i ≡ 0, 2 mod 3), while all other segments (i ≡ 1 mod 3) are long.
In a first step we show that all short segments can be moved from subset E to D since they can be attached to a long segment.
< previous part: OEIS/3x+1_Connectivity ^ up: OEIS/3x+1_Problem