arXiv · 1404.2710
On Collatz' Words, Sequences and Trees
Abstract
Motivated by a recent work of Trümper we consider the general Collatz word (up-down pattern) and the sequences following this pattern. The recurrences for the first and last sequence entries are given, obtained from repeated application of the general solution of a binary linear inhomogeneous Diophantine equation. These recurrences are then solved. The Collatz tree is also discussed.
Explore related subjects
Keep this discovery
Wolfdieter Lang. 2014-04-10. On Collatz' Words, Sequences and Trees. https://arxiv.org/abs/1404.2710
Cite the original work for its findings. Save a collection to share your selection of sources.