Added to Favorites

Related Searches

Nearby Words

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

## 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.
## External links

- 1, 11, 21, 1211, 111221, 312211, 13112221, 1113213211, ... .

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:

- 1 is read off as "one 1" or 11.
- 11 is read off as "two 1's" or 21.
- 21 is read off as "one 2, then one 1" or 1211.
- 1211 is read off as "one 1, then one 2, then two 1's" or 111221.
- 111221 is read off as "three 1, then two 2, then one 1" or 312211.

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

- The sequence grows indefinitely. In fact, any variant defined by starting with a different seed number will (eventually) also grow indefinitely, except for the degenerate sequence 22, 22, 22, 22 ... .
- No digits other than 1, 2, and 3 ever appear in the sequence, unless the seed number contains such a digit or a run of more than three of the same digit.
- Conway's cosmological theorem: Every sequence eventually splits into a sequence of "atomic elements", which are finite subsequences that never again interact with their neighbors. There are 92 elements containing the digits 1,2,3 only, which John Conway named after the natural chemical elements. There are also two "transuranic" elements for each digit larger than 3.
- The terms eventually grow in length by about 30% per generation. In fact, if $L\_n$ denotes the number of digits of the $n$-th member of the sequence, then

- $lim\_\{n\; to\; infty\}frac\{L\_\{n+1\}\}\{L\_\{n\}\}\; =\; lambda$

- where $lambda\; =\; 1.303577269ldots$ is an algebraic number of degree 71 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:

- $x^\{71\}\; -\; x^\{69\}\; -\; 2x^\{68\}\; -\; x^\{67\}\; +\; 2x^\{66\}\; +\; 2x^\{65\}\; +\; x^\{64\}\; -\; x^\{63\}\; -\; x^\{62\}\; -\; x^\{61\}\; -\; x^\{60\}\; -\; x^\{59\}$

- $\{\}\; +\; 2x^\{58\}\; +\; 5x^\{57\}\; +\; 3x^\{56\}\; -\; 2x^\{55\}\; -\; 10x^\{54\}\; -\; 3x^\{53\}\; -\; 2x^\{52\}\; +\; 6x^\{51\}\; +\; 6x^\{50\}\; +\; x^\{49\}\; +\; 9x^\{48\}\; -\; 3x^\{47\}$

- $\{\}\; -\; 7x^\{46\}\; -\; 8x^\{45\}\; -\; 8x^\{44\}\; +\; 10x^\{43\}\; +\; 6x^\{42\}\; +\; 8x^\{41\}\; -\; 5x^\{40\}\; -\; 12x^\{39\}\; +\; 7x^\{38\}\; -\; 7x^\{37\}\; +\; 7x^\{36\}\; +\; x^\{35\}$

- $\{\}\; -\; 3x^\{34\}\; +\; 10x^\{33\}\; +\; x^\{32\}\; -\; 6x^\{31\}\; -\; 2x^\{30\}\; -\; 10x^\{29\}\; -\; 3x^\{28\}\; +\; 2x^\{27\}\; +\; 9x^\{26\}\; -\; 3x^\{25\}\; +\; 14x^\{24\}\; -\; 8x^\{23\}$

- $\{\}\; -\; 7x^\{21\}\; +\; 9x^\{20\}\; +\; 3x^\{19\}\; -\; 4x^\{18\}\; -\; 10x^\{17\}\; -\; 7x^\{16\}\; +\; 12x^\{15\}\; +\; 7x^\{14\}\; +\; 2x^\{13\}\; -\; 12x^\{12\}\; -\; 4x^\{11\}$

- $\{\}\; -\; 2x^\{10\}\; +\; 5x^9\; +\; x^7\; -\; 7x^6\; +\; 7x^5\; -\; 4x^4\; +\; 12x^3\; -\; 6x^2\; +\; 3x\; -\; 6.$

This sequence is also referred to as containing Langford numbers.

Wikipedia, the free encyclopedia © 2001-2006 Wikipedia contributors (Disclaimer)

This article is licensed under the GNU Free Documentation License.

Last updated on Monday October 06, 2008 at 16:25:48 PDT (GMT -0700)

View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation

This article is licensed under the GNU Free Documentation License.

Last updated on Monday October 06, 2008 at 16:25:48 PDT (GMT -0700)

View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation

Copyright © 2014 Dictionary.com, LLC. All rights reserved.