On Curling Numbers of Integer Sequences

MaRDI QIDQ5404309zbMATH OpenFDO

Authors Benjamin Chaffin, John P. Linderman, N. J. A. Sloane, Allan R. Wilks

Publication date 24 March 2014

Full work available at URL https://arxiv.org/abs/1212.6102, http://www.emis.de/journals/JIS/VOL16/Sloane/sloane3.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

curling numberFine-Wilf theoremGijswijt sequence

Mathematics Subject Classification ID

Combinatorics on words (68R15) Recurrences (11B37)

Abstract: Given a finite nonempty sequence S of integers, write it as XY^k, where Y^k 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.

Recommendations

• scientific article
• ``Choix de Bruxelles: a new operation on positive integers
• scientific article; zbMATH DE number 1740033
• Enumerating Kautz sequences
• On-line sorting of twisted sequences in linear time
• Persistence: a digit problem
• Self-generating sets, integers with missing blocks, and substitutions
• Divergent RATS sequences
• Connections between binary patterns and paperfolding
• scientific article; zbMATH DE number 1311365

Cited in

(8)

• Borders, palindrome prefixes, and square prefixes
• On the curling number of certain graphs
• Some new results on the curling number of graphs
• A study on the curling number of certain graph classes
• Curling number of rooted product of general graph
• On the curling number of the Mycielskian of certain graphs
• ``A handbook of Integer sequences fifty years later
• Three cousins of Recamán's sequence

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: On Curling Numbers of Integer Sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5404309)