Abstract

In this paper we consider a variant of Conway's sequence (OEIS A005150, A006715) defined as follows: the next term in the sequence is obtained by considering contiguous runs of digits, and rewriting them as abab where bb is the digit and aa is the maximum of bb and the run's length. We dub this the "look-and-say the biggest" (LSB) sequence. Conway's sequence is very similar (bb is just the run's length). For any starting value except 22, Conway's sequence grows exponentially: the ration of lengths converges to a known constant λλ. We show that LSB does not: for every starting value, LSB eventually reaches a cycle. Furthermore, all cycles have a period of at most 9.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.