Clever Geek Handbook
📜 ⬆️ ⬇️

Look-and-Say Sequence

The graphs show an increase in the number of digits in the Look-and-Say sequence with initial numbers: 1 (blue), 13 (purple), 23 (red) and 312 (green). These graphs tend to straight lines (the vertical scale is represented on a logarithmic scale )

The Look-and-Say sequence is a sequence of numbers starting as follows:

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

Each subsequent number is generated from the previous one by concatenating a digit, which consists of a group of identical digits and the number of digits in this group, for each group of identical digits in a number. For example:

  • 1 reads as “one unit,” that is, 11
  • 11 reads as “two units,” that is, 21
  • 21 reads as “one deuce, one unit”, that is 1211
  • 1211 reads as “one unit, one two, two units”, that is, 111221
  • 111221 reads as “three units, two deuces, one unit”, that is, 312211
  • 312211 reads as “one three, one unit, two deuces, two units”, that is 13112221

The look-and-say sequence was proposed by John Conway [1] .

For an arbitrary digit d , except for unity, as the initial, the sequence takes the form:

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

Content

Key Features

 
The roots of the Conway polynomial on the complex plane

Growth

The sequence grows endlessly. In fact, any variant of the sequence with an integer initial number will grow indefinitely. The exception is the sequence:

22, 22, 22, 22, 22, ... (sequence A010861 in OEIS ).

Limit the numbers used

No digits except 1, 2 and 3 are found in the sequence if the initial number does not contain other digits or a group of more than three digits [2] .

Number Length Increase

On average, numbers grow by 30% per iteration. If aLn {\ displaystyle L_ {n}}   denotes the length of the nth term of the sequence, then there is a limit to the ratioLn+oneLn {\ displaystyle {\ frac {L_ {n + 1}} {L_ {n}}}}   :

limn→∞Ln+oneLn=λ{\ displaystyle \ lim _ {n \ to \ infty} {\ frac {L_ {n + 1}} {L_ {n}}} = \ lambda}   .

Here λ = 1.303577269034 ... is the Conway constant [2] . The same result holds for any variation of the sequence with an initial number other than 22.

Polynomial Returning Conway's Constant

Conway constant is the only positive material root of the polynomial:

x71-x69-2x68-x67+2x66+2x65+x64-x63-x62-x61-x60-x59+2x58+fivex57+3x56-2x55-tenx54-3x53-2x52+6x51+6x50+x49+9x48-3x47-7x46-eightx45-eightx44+tenx43+6x42+eightx41-fivex40-12x39+7x38-7x37+7x36+x35-3x34+tenx33+x32-6x31-2xthirty-tenx29th-3x28+2x27+9x26-3x25+14x24-eightx23-7x21+9x20+3xnineteen-fourx18-tenx17-7xsixteen+12x15+7x14+2x13-12x12-fourxeleven-2xten+fivex9+x7-7x6+7xfive-fourxfour+12x3-6x2+3x-6{\ displaystyle {\ begin {aligned} & \, \, \, \, \, \, \, 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 \ end {aligned}}}  

In his original article, Conway makes a mistake by writing “-” instead of “+” beforex35 {\ displaystyle x ^ {35}}   . But the value of λ given in his article is true [3] .

Popularization

The Look-and-Say sequence is also known as the Morris number sequence in honor of cryptographer . It is sometimes referred to as the “cuckoo egg” because of the puzzle “What is the next number in the sequence 1, 11, 21, 1211, 111221?” Described by Morris in Clifford Stoll’s book “The Cuckoo Egg”.

Variations

There are many variations of the rules for creating sequences like Look-and-Say. For example, the sequence “pea pattern”. It differs from Look-and-Say in that in order to get a new number in it you need to count all the same numbers in a number. Starting from the number 1, we get: 1, 11 (one unit), 21 (two units), 1211 (one two, one unit), 3112 (three units, one two), 132112 (one three, two units, one two) , 312213 (three units, two deuces, one three), etc. As a result, the sequence comes to a cycle of two numbers, 23322114 and 32232114. [4]

There is another option that differs from the pea pattern in that the numbers are counted in ascending order, and not as they appear. Starting from one, we get the sequence: 1, 11, 21, 1112, 3112, 211213, 312213, ...

These sequences have notable differences from Look-and-Say. Unlike the Conway sequence, this member in the pea pattern does not uniquely identify the previous member. The length of the numbers in the “pea pattern” is limited and, for the b-number system , does not exceed 2b, and reaches 3b for large initial numbers (for example, “one hundred units”).

Given that this sequence is infinite and its length is limited, it must ultimately be repeated according to the Dirichlet principle . As a result, these sequences are always periodic.

See also

  • Spikelet sequence
  • Guiswith sequence

Notes

  1. ↑ John Horton Conway. The Weird and Wonderful Chemistry of Audioactive Decay (English) // Eureka. - 1986 .-- January ( vol. 46 ). - P. 5-16 . Archived on October 11, 2014.
  2. ↑ 1 2 Oscar Martin. Look-and-Say Biochemistry: Exponential RNA and Multistranded DNA (English) // American Mathematical Monthly. - 2006. - Vol. 113 , no. 4 . - P. 289-307 . - ISSN 0002-9890 . Archived December 24, 2006.
  3. ↑ Ilan Vardi. Computational Recreation in Mathematica.
  4. ↑ Ascending Pea Pattern generator (neopr.) .
Source - https://ru.wikipedia.org/w/index.php?title= Sequence_ by yourself Look-- tell me &&&oldid = 98632539


More articles:

  • Gould Robert
  • 2018 European Triathlon Championship
  • Eschborn - Frankfurt 2016
  • Madagascar-French Relations
  • Abrahamsson, Peter
  • Conchius, Pranas
  • Type 65 (submachine gun)
  • Flache Raymond
  • Talwar Bernard
  • Asbestos

All articles

Clever Geek | 2019