If the Collatz trajectory of n reaches 1, say after k steps, and there is an integer m > n such that T^i(m) and T^i(n) have the same parity for i = 0..k (where T^i denotes the i-th iterate of the Collatz map A006370), then a(n) is the least such m, otherwise a(n) is -1.
A348094
If the Collatz trajectory of n reaches 1, say after k steps, and there is an integer m > n such that T^i(m) and T^i(n) have the same parity for i = 0..k (where T^i denotes the i-th iterate of the Collatz map A006370), then a(n) is the least such m, otherwise a(n) is -1.
Terms
- a(0) =2a(1) =4a(2) =35a(3) =8a(4) =21a(5) =70a(6) =2055a(7) =16a(8) =8201a(9) =42a(10) =1035a(11) =140a(12) =141a(13) =4110a(14) =4111a(15) =32a(16) =529a(17) =16402a(18) =16403a(19) =84a(20) =85a(21) =2070a(22) =2071a(23) =280a(24) =65561a(25) =282a(27) =8220a(28) =8221a(29) =8222a(31) =64
External references
- oeis: A348094