Collatz meets Fibonacci
Abstract
The Collatz map is defined for a positive even integer as half that integer, and for a positive odd integer as that integer threefold, plus one. The Collatz conjecture states that when the map is iterated the number one is eventually reached. We study permutations that arise as sequences from this iteration. We show that permutations of this type of length up to 14 are enumerated by the Fibonacci numbers. Beyond that excess permutations appear. We will explain the appearance of these excess permutations and give an upper bound on the exact enumeration.
 Publication:

arXiv eprints
 Pub Date:
 April 2014
 arXiv:
 arXiv:1404.3054
 Bibcode:
 2014arXiv1404.3054A
 Keywords:

 Mathematics  Combinatorics;
 05A05;
 G.2.1
 EPrint:
 7 pages, 2 figures, 2 tables