recurrence sequence

In this work justified incorrectness of the algorithm proposed in the publication "M. Remer.[A Comparative Analysis of the New -3(-n) - 1 Remer Conjecture and a Proof of the 3n + 1 Collatz Conjecture. Journal of Applied Mathematics and Physics. Vol.11 No.8, August 2023"] in terms of the Collatz conjecture. And also that the transformation -3(-n) - 1 is not equivalent to Collatz's conjecture on the natural numbers 3n + 1. The obtained results can be used in further studies of the Collatz hypothesis

The work shows that the task is the problem C_3q±​1=3q±1 conjecture positive integers q>1in the reverse direction n→0 of the branching of the Jacobsthal tree, according to the rules of transformations of recurrent Jacobsthal numbers. For the first time, the Collatz problem is analyzed from the point of view of the increase in information entropy after the passage of the so-called fusion points (nodes) on the polynomials θ*2ⁿ by the Сollatz trajectories.