Characterizing The Collatz Sequence

                   Bradley Berg                                             June 11, 2026

1.0 Introduction

1.1 Expand the Sequence


1.2 Bounds On DL


1.3 Trivial Run Lengths

2.0 Long Run Lengths


2.1 Lowest Seed Per Run Length

2.2 Magic Beans

3.0 Concluding Summary

References


Appendix A: Excluding Trivial Runs


Appendix B: Extended Filter For Trivial Runs


Appendix C: Smallest Seed For Run Lengths



Appendix D: Smallest Beans For Long Lengths


Appendix E: Beans With 40 Low Order One Bits

Beans with 40 low order one bits were computed up through 84 bits. This effort is currently still in progress.