Comment to the program The fitting of Collatz sequences

Definitions
Collatz sequence: pi ∈ N+ ∧ pi is odd, for i > 0: pi = (3pi - 1 + 1) / di - 1. The Collatz divisor di - 1 = 2xi - 1, in which xi - 1 is the number of times that (3p i - 1 + 1) is divided by 2 to reach the odd pi. Notation: p0 (d0) p1 (d1) p2 (d2) ... pn - 1 (dn - 1) pn | pn = 1.
Length: For all positive odd integers p: n is the Length of p if n is the lowest index i for which pi = 1. Notation: Lth(p) = n.
Evenness: For all positive odds p > 1, s is called the Evenness of p if s is the sum of the exponents xi for 0 ≤ i ≤ (n - 1) of the Collatz divisors di = 2xi.
Notation: Evn(p) = s.
Rho: 2Evn(p) / (p • 3Lth(p)). Notation: Rho(p).

Appropriate other programs on this site
For the above (and other) computational properties of Collatz sequences, see: Computational properties of Collatz sequences.
For the Collatz equation (below) of any odd integer p, see: Collatz equation.
For a comparable program, for all variables of the Collatz equation, see Variables of the equation of reduced Collatz sequences and Comment.
See also the program Equal Length of reduced Collatz sequences of neighboring positive odds.
For a listing of all possibilities (combinatorial compositions) for calculated p-values (fitting or not), see: Constrained combinatorial compositions and Collatz sequences and Comment
See also the program Constrained compositions of Collatz divisor exponents and Comment. This program finds reduced Collatz sequences of odds p having n = Lth(p) ∧ s = Evn(p) and their compositions by screening adjustable batches of maximal 3000 positive odds. The odds are allowed to have up to 12 digits. Maximum sequence Length: 250; maximum sequence Evenness: 550.

Collatz equation
p0.3n + [3n - 1 + 3n - 2.2x0 + 3n - 3.2x0 + x1 + 3n - 4.2x0 + x1 + x2 + ... + 3.2x0 + x1 + x2 + ... + xn - 3 + 2x0 + x1 + x2 + ... + xn - 2] = 2x0 + x1 + x2 + ... + xn - 1

Program variables and sequence fitting
A = 2s - p.3n = 2x0 + x1 + x2 + ... + xn - 1 - p.3n = 3n - 1 + 3n - 2.2x0 + 3n - 3.2x0 + x1 + 3n - 4.2x0 + x1 + x2 + ... + 3.2x0 + x1 + x2 + ... + xn - 3 + 2x0 + x1 + x2 + ... + xn - 2
n = Lth(p) = the number of iterations to reach 1.
s = Evn(p) = the sum of the exponents xi of the Collatz divisors di.
nmax = 25 in our program and 25 ≤ smax ≤ 39. smax is made dependent on n: to keep calculation time reasonably.
The program calculates the minimum and maximum value of A:
Any Collatz divisor is at least 2 (xi ≥ 1) and for p > 1 the final Collatz divisor is at least 16 (xn - 1 ≥ 4). From these A-values the corresponding p-values are calculated (not necessarily positive and integer). The minimum p-value is rounded to the nearest higher positive odd integer, the maximum p-value is rounded to the nearest lower positive odd integer p. The program investigates the odd integers from pmin to pmax for Lth(p) = n and Evn(p) = s.