2012/12/31 by Benjamin Chaffin, John P. Linderman, N. J. A. Sloane +1
Mathematics · Computer Science · #math.CO #cs.DM #msc:68R15 #msc:11B37
published as J. Integer Sequences 16 (2013), #13.4.3 · 25 pages, one figure, 14 tables. This paper is a sequel to the paper arXiv:0912.2382. Feb 17 2013: added list of OEIS sequences that are mentioned. March 12 2013: A number of small improvements
arxiv created 2013/03/12 · arxiv updated 2014/09/17
Given a finite nonempty sequence S of integers, write it as XYk, where Yk is a power of greatest exponent that is a suffix of S: this k is the curling number of S. The Curling Number Conjecture is that if one starts with any initial sequence S, and extends it by repeatedly appending the curling number of the current sequence, the sequence will eventually reach 1. The conjecture remains open. In this paper we discuss the special case when S consists just of 2's and 3's. Even this case remains open, but we determine how far a sequence of n 2's and 3's can extend before reaching a 1, conjecturally for n <= 80. We investigate several related combinatorial problems, such as finding c(n,k), the number of binary sequences of length n and curling number k, and t(n,i), the number of sequences of length n which extend for i steps before reaching a 1. A number of interesting combinatorial problems remain unsolved.