Collatz meets Fibonacci

DOI10.1080/0025570X.2022.2023307MaRDI QIDQ6250666arXivFDO

Authors Michael Albert, Bjarki Agust Gudmundsson, Henning Úlfarsson

Publication date 11 April 2014

Published in arXiv

Full work available at URL https://doi.org/10.1080/0025570X.2022.2023307

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Recurrences (11B37) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Special sequences and polynomials (11B83)

arXiv classification

math.CO

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.

This page was built for publication: Collatz meets Fibonacci

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6250666)