It is shown that: 1. The sequence {2^{0},2^{1}, 2^{2}, 2^{3}, 2^{4}, 2^{5}, 2^{6}, 2^{7},2^{8},...} that forms the main graph m=1 of Collatz is related to the power transformation of Newton's binomial (1+1)^{ξ}, ξ=0, 1, 2, 3,... 2. The main K_{main} and side m >1 graphs and their corresponding sequences {K_{main} } and {K_{m} } are related by the relation {K_{m} }=m⋅{K_{main} }. 3. Side graphs generated by prime odd numbers 5, 7, 11, 13, 17, 19, 23, 25, 29, 31,…are not divisible by three, are formed without nodes. Side graphs, which are generated by compozite of odd numbers 3, 9, 15, 21, 27, 33, 39, 45,… are divisible by three, are formed with nodes. 4. The trajectories of transformations of odd numbers, through 3, 6, 8,…. iterations from the beginning of calculations, merge with a trajectory of calculations of the first smaller number on value of the number.

1. L.Collatz. On the motivation and origin of the (3n + 1) – Problem, J. Qufu Normal University, Natural Science Edition.1986, 12(3), 9–11.

2.The On-line encyclopedia of integer sequences. The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. https://oeis.org/A002450

3. J. Lagarias. The 3x+ 1 problem: An annotated bibliography (1963–1999), 2011. arXiv:math/0309224.

4. J. Lagarias. The 3x + 1 problem: An annotated bibliography, II (2000–2009), 2012. arXiv:math/0608208.

5. H. Ebert. A Graph Theoretical Approach to the Collatz Problem. arXiv:1905.07575v5 [math.GM] 29 Jul 2021

6. P. Andaloro. The 3x+1 problem and directed graphs, Fibonacci Quarterly. 2002, 40 43 -54

7. D. Kay. Collatz Sequences and Characteristic Zero-One Strings: Progress on the 3x + 1 Problem. American Journal of Computational Mathematics. 2021, 11(3), 2026-239, https://doi.org/10.4236/ajcm.2021.113015

8. B. Bondarenko. Generalized Pascal Triangles and Pyramids. Their Fractals, Graphs, and Applications. Translated by Richard C. Bollinger. Published 1993 by the Fibonacci Association