Equal Length of reduced Collatz sequences of neighboring positive odds

Equal Length of reduced Collatz sequences of neighboring positive odds
The Length n of a reduced Collatz sequence starting with a positive odd integer p is the number of iterations (from odd to odd) to reach 1, denoted Lth(p) = n. Read our Comment for more definitions.

When your input is a positive odd integer p, then Lth(p) = n is calculated.
The program searches for p_L = the nearest odd < p having Lth(p_L) = Lth(p) and p_H = the nearest odd > p having Lth(p_H) = Lth(p).

The results shown are: Lth(p) = n, the reduced Collatz sequences of p_L, p, p_H and Evn(p_L), Evn(p) and Evn(p_H). For Evenness, denoted Evn(p) = s, see our Comment.

Positive odd integer p:

CCCC