The Comma Sequence is Finite in Other Bases
Abstract
The comma sequence (1, 12, 35, 94, ...) is the lexicographically earliest sequence such that the difference of consecutive terms equals the concatenation of the digits on either side of the comma separating them. The behavior of a "generalized comma sequence" depends on the base the numbers are written in, as well as the sequence's initial values. We provide a computational proof that all comma sequences in bases 3 through 633 are finite. Relying on a combinatorial conjecture, Angelini et al. estimated that the final element of a comma sequence in base b should be roughly exp(O(b)). We prove their conjecture, but provide evidence that the correct estimate is actually exp(O(b log b)).
Cite
@article{arxiv.2408.03434,
title = {The Comma Sequence is Finite in Other Bases},
author = {Robert Dougherty-Bliss and Natalya Ter-Saakov},
journal= {arXiv preprint arXiv:2408.03434},
year = {2024}
}
Comments
This version handles much larger bases by using a superior cycle-detection algorithm suggested by Luke Pebody