Look-and-say sequence

In mathematics, the look-and-say sequence is the sequence of integers beginning as follows:

1, 11, 21, 1211, 111221, 312211, 13112221, 1113213211, ... (sequence A005150 in OEIS).

To generate a member of the sequence from the previous member, read off the digits of the previous member, counting the number of digits in groups of the same digit. For example:

The idea is similar to that of run-length encoding.

If we start with any digit d from 0 to 9, d will remain indefinitely as the last digit of the sequence. For d different from 1, the sequence starts as follows:

d, 1d, 111d, 311d, 13211d, 111312211d, 31131122211d, …

Ilan Vardi has called this sequence, starting with d = 3, the Conway sequence (sequence A006715 in OEIS).[1]

Contents

Basic properties

\lim_{n \to \infty}\frac{L_{n%2B1}}{L_{n}} = \lambda
where \scriptstyle \lambda = 1.303577269\ldots is an algebraic number of degree 71[2] known as Conway's constant. This fact was proven by Conway. This also holds for variants of the sequence starting with any integer other than 22.

Conway's constant is the unique positive real root of the following polynomial:

\begin{align}
 x^{71}   &&- x^{69}   &&- 2x^{68}  &&- x^{67}   &&%2B 2x^{66}  &&%2B 2x^{65}  &&%2B x^{64}   &&- x^{63}   &&- x^{62}  - \\
 x^{61}   &&- x^{60}   &&- x^{59}   &&%2B 2x^{58}  &&%2B 5x^{57}  &&%2B 3x^{56}  &&- 2x^{55}  &&- 10x^{54} &&- 3x^{53} - \\
 2x^{52}  &&%2B 6x^{51}  &&%2B 6x^{50}  &&%2B x^{49}   &&%2B 9x^{48}  &&- 3x^{47}  &&- 7x^{46}  &&- 8x^{45}  &&- 8x^{44} %2B \\
 10x^{43} &&%2B 6x^{42}  &&%2B 8x^{41}  &&- 5x^{40}  &&- 12x^{39} &&%2B 7x^{38}  &&- 7x^{37}  &&%2B 7x^{36}  &&%2B x^{35}  - \\
 3x^{34}  &&%2B 10x^{33} &&%2B x^{32}   &&- 6x^{31}  &&- 2x^{30}  &&- 10x^{29} &&- 3x^{28}  &&%2B 2x^{27}  &&%2B 9x^{26} - \\
 3x^{25}  &&%2B 14x^{24} &&- 8x^{23}  &&- 7x^{21}  &&%2B 9x^{20}  &&%2B 3x^{19}  &&- 4x^{18}  &&- 10x^{17} &&- 7x^{16} %2B \\
 12x^{15} &&%2B 7x^{14}  &&%2B 2x^{13}  &&- 12x^{12} &&- 4x^{11}  &&- 2x^{10}  &&%2B 5x^9     &&%2B x^7      &&- 7x^6    %2B \\
 7x^5     &&- 4x^4     &&%2B 12x^3    &&- 6x^2     &&%2B 3x       &&- 6
\end{align}

Origin

It was introduced and analyzed by John Conway in his paper "The Weird and Wonderful Chemistry of Audioactive Decay" published in Eureka 46, 5–18 in 1986.

Popularization

It is also popularly known as the Morris Number Sequence, after cryptographer Robert Morris, and the puzzle is sometimes referred to as the Cuckoo's Egg from a description of Morris in Clifford Stoll's book The Cuckoo's Egg.[4][5]

Computer program

The following Python code generates a look-and-say sequence using lazy evaluation:

def look_and_say(member):
    while True:
        yield member
        breakpoints = [0]+[i for i in range(1,len(member)) if member[i-1] != member[i]]+[len(member)]
        groups = [member[breakpoints[i-1]:breakpoints[i]] for i in range(1,len(breakpoints))]
        member = ''.join(str(len(group)) + group[0] for group in groups)
 
# Print the 10-element sequence beginning with "1"
sequence = look_and_say("1")
for i in range(10):
    print sequence.next()

Pea pattern

This is described as being the series which counts the number of occurrences of a digit and appears for the first few steps to have similarities with the Look-andSay(1) series. Pea(1) proceeds 1, 11, 21, 1112 (reading as 1 occurence of 1 and 1 of 2), 3112, 211213, but after 15 steps Pea(1) loops at 21322314. This looping characteristic also occurs with Pea(2), Pea(3) and Pea(4). Pea(0) loops at 1021223314, with D=5-9 looping at 312233141D.

References

  1. ^ Conway Sequence, MathWorld, accessed on line February 4, 2011.
  2. ^ a b c d Martin, Oscar (2006). "Look-and-Say Biochemistry: Exponential RNA and Multistranded DNA". American mathematical monthly (Mathematical association of America) 113 (4): pp. 289–307. ISSN 0002-9890. http://www.uam.es/personal_pdi/ciencias/omartin/Biochem.PDF. Retrieved January 6, 2010. 
  3. ^ Ekhad, S. B., Zeilberger, D.: Proof of Conway's lost cosmological theorem, Electronic Research Announcements of the American Mathematical Society, August 21, 1997, Vol. 5, pp. 78-82. Retrieved July 4, 2011.
  4. ^ Robert Morris Sequence
  5. ^ FAQ about Morris Number Sequence

External links