Abstract
S. Golomb discovered a self describing sequence of integers with a simple asymptotic behavior. This paper examines how close the sequence is to the asymptotic estimate. I give an upper bound for the error term and give strong evidence that this upper bound is actually the best possible. The evidence consists of a formal solution to a recurrence relation, as well as numerical evidence. I also present an efficient method for computing Golomb's sequence for large values. This method relies on the enumeration of a special kind of tree.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
