On heights in the Collatz 3n + 1 problem

In the Collate problem, certain runs of consecutive integers have the same height. This phenomenon is investigated using an algorithm for reconstructing the trajectory of a number from the parity vector of the number. It is found that pairs of consecutive integers of the same height occur infinitely often and in infinitely many different patterns