RECURRENCE AND STRUCTURING OF SEQUENCES OF TRANSFORMATIONS 3N + 1 AS ARGUMENTS FOR CONFIRMATION OF THE СOLLATZ HYPOTHESIS
It is shown that infinites of the subsequence of odd numbers is not a counterargument of the violation of the Collatz hypothesis, but a universal characteristic of transformations of natural numbers by the 3n + 1 algorithm. A recurrent relationship is established between the parameters of the sequence of Collatz transformations of an arbitrary pair of natural numbers n and 2n.