The exponential growth rate of the full Collatz inverse tree

How many positive integers reach 1 for the first time after exactly N steps of the Collatz map? Count each odd step from x to 3x+1 and each even step from x to x/2 separately. If a(N) is the resulting count (OEIS A005186), this paper proves that its Nth root converges to (3 + √21)/6, approximately 1.2637626. Whether the successive ratios a(N+1)/a(N) converge remains open. The proof bounds the joint entropy of two consecutive base-3 digits to establish absolute continuity of a 3-adic Syracuse law. A comparison on residue classes connects that law to the inverse tree rooted at 1. If only vertices coprime to 3 are retained, the smallest and largest level counts across all such roots also have this exponential growth rate. The computational supplement includes the LaTeX sources, verification code, certificate data and reproduction instructions. Its note, Finite-depth certificates for A005186, reconstructs the earlier depth-18 bounds and proves that a(N + d) ≥ (1.2637)^d a(N)/10 for all nonnegative integers N and d. The manuscript, certificate note, documentation and data are licensed under CC BY 4.0. The Python and C code is licensed under MIT.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-18
DOI
https://doi.org/10.5281/zenodo.24352662
Primary Topic
Analytic Number Theory Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

The exponential growth rate of the full Collatz inverse tree

Anthony Garcia-Labiad
5 links
Zenodo (CERN European Organization for Nuclear Research)
Analytic Number Theory Research
preprint

The exponential growth rate of the full Collatz inverse tree

Anthony Garcia-Labiad
preprint en

Abstract

How many positive integers reach 1 for the first time after exactly N steps of the Collatz map? Count each odd step from x to 3x+1 and each even step from x to x/2 separately. If a(N) is the resulting count (OEIS A005186), this paper proves that its Nth root converges to (3 + √21)/6, approximately 1.2637626. Whether the successive ratios a(N+1)/a(N) converge remains open. The proof bounds the joint entropy of two consecutive base-3 digits to establish absolute continuity of a 3-adic Syracuse law. A comparison on residue classes connects that law to the inverse tree rooted at 1. If only vertices coprime to 3 are retained, the smallest and largest level counts across all such roots also have this exponential growth rate. The computational supplement includes the LaTeX sources, verification code, certificate data and reproduction instructions. Its note, Finite-depth certificates for A005186, reconstructs the earlier depth-18 bounds and proves that a(N + d) ≥ (1.2637)^d a(N)/10 for all nonnegative integers N and d. The manuscript, certificate note, documentation and data are licensed under CC BY 4.0. The Python and C code is licensed under MIT.

Zenodo (CERN European Organization for Nuclear Research)
Analytic Number Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon