Look-and-say sequence explained

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

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

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 look-and-say sequence was analyzed by John Conway[1] after he was introduced to it by one of his students at a party.[2]

The idea of the look-and-say sequence is similar to that of run-length encoding.

If started with any digit d from 0 to 9 then d will remain indefinitely as the last digit of the sequence. For any d other than 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 . (for d = 2, see)[3]

Basic properties

Growth

The sequence grows indefinitely. In fact, any variant defined by starting with a different integer seed number will (eventually) also grow indefinitely, except for the degenerate sequence: 22, 22, 22, 22, ... which remains the same size.

Digits presence limitation

No digits other than 1, 2, and 3 appear in the sequence, unless the seed number contains such a digit or a run of more than three of the same digit.[4]

Cosmological decay

Conway's cosmological theorem asserts that every sequence eventually splits ("decays") 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, and 3 only, which John Conway named after the 92 naturally-occurring chemical elements up to uranium, calling the sequence audioactive. There are also two "transuranic" elements (Np and Pu) for each digit other than 1, 2, and 3.[4] [5] Below is a table of all such elements:

All "atomic elements" (Where Ek is included within the derivate of Ek+1 except Np and Pu)
Atomic number (n)Element name (Ek)SequenceDecays intoAbundance
1H22H91790.383216
2He13112221133211322112211213322112Hf.Pa.H.Ca.Li3237.2968588
3Li312211322212221121123222112He4220.0665982
4Be111312211312113221133211322112211213322112Ge.Ca.Li2263.8860325
5B1321132122211322212221121123222112Be2951.1503716
6C3113112211322112211213322112B3847.0525419
7N111312212221121123222112C5014.9302464
8O132112211213322112N6537.3490750
9F31121123222112O8521.9396539
10Ne111213322112F11109.006696
11Na123222112Ne14481.448773
12Mg3113322112Pm.Na18850.441228
13Al1113222112Mg24573.006696
14Si1322112Al32032.812960
15P311311222112Ho.Si14895.886658
16S1113122112P19417.939250
17Cl132112S25312.784218
18Ar3112Cl32997.170122
19K1112Ar43014.360913
20Ca12K56072.543129
21Sc3113112221133112Ho.Pa.H.Ca.Co9302.0974443
22Ti11131221131112Sc12126.002783
23V13211312Ti15807.181592
24Cr31132V20605.882611
25Mn111311222112Cr.Si26861.360180
26Fe13122112Mn35015.858546
27Co32112Fe45645.877256
28Ni11133112Zn.Co13871.123200
29Cu131112Ni18082.082203
30Zn312Cu23571.391336
31Ga13221133122211332Eu.Ca.Ac.H.Ca.Zn1447.8905642
32Ge31131122211311122113222Ho.Ga1887.4372276
33As11131221131211322113322112Ge.Na27.246216076
34Se13211321222113222112As35.517547944
35Br3113112211322112Se46.299868152
36Kr11131221222112Br60.355455682
37Rb1321122112Kr78.678000089
38Sr3112112Rb102.56285249
39Y1112133Sr.U133.69860315
40Zr12322211331222113112211Y.H.Ca.Tc174.28645997
41Nb1113122113322113111221131221Er.Zr227.19586752
42Mo13211322211312113211Nb296.16736852
43Tc311322113212221Mo386.07704943
44Ru132211331222113112211Eu.Ca.Tc328.99480576
45Rh311311222113111221131221Ho.Ru428.87015041
46Pd111312211312113211Rh559.06537946
47Ag132113212221Pd728.78492056
48Cd3113112211Ag950.02745646
49In11131221Cd1238.4341972
50Sn13211In1614.3946687
51Sb3112221Pm.Sn2104.4881933
52Te1322113312211Eu.Ca.Sb2743.3629718
53I311311222113111221Ho.Te3576.1856107
54Xe11131221131211I4661.8342720
55Cs13211321Xe6077.0611889
56Ba311311Cs7921.9188284
57La11131Ba10326.833312
58Ce1321133112La.H.Ca.Co13461.825166
59Pr31131112Ce17548.529287
60Nd111312Pr22875.863883
61Pm132Nd29820.456167
62Sm311332Pm.Ca.Zn15408.115182
63Eu1113222Sm20085.668709
64Gd13221133112Eu.Ca.Co21662.972821
65Tb3113112221131112Ho.Gd28239.358949
66Dy111312211312Tb36812.186418
67Ho1321132Dy47987.529438
68Er311311222Ho.Pm1098.5955997
69Tm11131221133112Er.Ca.Co1204.9083841
70Yb1321131112Tm1570.6911808
71Lu311312Yb2047.5173200
72Hf11132Lu2669.0970363
73Ta13112221133211322112211213322113Hf.Pa.H.Ca.W242.07736666
74W312211322212221121123222113Ta315.56655252
75Re111312211312113221133211322112211213322113Ge.Ca.W169.28801808
76Os1321132122211322212221121123222113Re220.68001229
77Ir3113112211322112211213322113Os287.67344775
78Pt111312212221121123222113Ir375.00456738
79Au132112211213322113Pt488.84742982
80Hg31121123222113Au637.25039755
81Tl111213322113Hg830.70513293
82Pb123222113Tl1082.8883285
83Bi3113322113Pm.Pb1411.6286100
84Po1113222113Bi1840.1669683
85At1322113Po2398.7998311
86Rn311311222113Ho.At3127.0209328
87Fr1113122113Rn4076.3134078
88Ra132113Fr5313.7894999
89Ac3113Ra6926.9352045
90Th1113Ac7581.9047125
91Pa13Th9883.5986392
92U3Pa102.56285249
Transuranic elements
93Np1311222113321132211221121332211nHf.Pa.H.Ca.Pu0
94Pu31221132221222112112322211nNp0

Growth in length

The terms eventually grow in length by about 30% per generation. In particular, if Ln denotes the number of digits of the n-th member of the sequence, then the limit of the ratio

Ln
Ln
exists and is given by\lim_ \frac = \lambda

where λ = 1.303577269034... is an algebraic number of degree 71.[4] This fact was proven by Conway, and the constant λ is known as Conway's constant. The same result also holds for every variant of the sequence starting with any seed other than 22.

Conway's constant as a polynomial root

Conway's constant is the unique positive real root of the following polynomial :\begin & &\qquad & &\qquad & &\qquad & & +1x^ & \\ -1x^ & -2x^ & -1x^ & +2x^ & +2x^ & +1x^ & -1x^ & -1x^ & -1x^ & -1x^ \\ -1x^ & +2x^ & +5x^ & +3x^ & -2x^ & -10x^ & -3x^ & -2x^ & +6x^ & +6x^ \\ +1x^ & +9x^ & -3x^ & -7x^ & -8x^ & -8x^ & +10x^ & +6x^ & +8x^ & -5x^ \\ -12x^ & +7x^ & -7x^ & +7x^ & +1x^ & -3x^ & +10x^ & +1x^ & -6x^ & -2x^ \\ -10x^ & -3x^ & +2x^ & +9x^ & -3x^ & +14x^ & -8x^ & & -7x^ & +9x^ \\ +3x^ & -4x^ & -10x^ & -7x^ & +12x^ & +7x^ & +2x^ & -12x^ & -4x^ & -2x^ \\ +5x^ & & +1x^ & -7x^ & +7x^ & -4x^ & +12x^ & -6x^ & +3x^ & -6x^ \\\end

This polynomial was correctly given in Conway's original Eureka article,but in the reprinted version in the book edited by Cover and Gopinath the term

x35

was incorrectly printed with a minus sign in front.[6]

Popularization

The look-and-say sequence is also popularly known as the Morris Number Sequence, after cryptographer Robert Morris, and the puzzle "What is the next number in the sequence 1, 11, 21, 1211, 111221?" is sometimes referred to as the Cuckoo's Egg, from a description of Morris in Clifford Stoll's book The Cuckoo's Egg.[7] [8]

Variations

There are many possible variations on the rule used to generate the look-and-say sequence. For example, to form the "pea pattern" one reads the previous term and counts all instances of each digit, listed in order of their first appearance, not just those occurring in a consecutive block. So beginning with the seed 1, the pea pattern proceeds 1, 11 ("one 1"), 21 ("two 1s"), 1211 ("one 2 and one 1"), 3112 ("three 1s and one 2"), 132112 ("one 3, two 1s and one 2"), 311322 ("three 1s, one 3 and two 2s"), etc. This version of the pea pattern eventually forms a cycle with the two "atomic" terms 23322114 and 32232114.

Other versions of the pea pattern are also possible; for example, instead of reading the digits as they first appear, one could read them in ascending order instead. In this case, the term following 21 would be 1112 ("one 1, one 2") and the term following 3112 would be 211213 ("two 1s, one 2 and one 3").

These sequences differ in several notable ways from the look-and-say sequence. Notably, unlike the Conway sequences, a given term of the pea pattern does not uniquely define the preceding term. Moreover, for any seed the pea pattern produces terms of bounded length: This bound will not typically exceed (22 digits for decimal:) and may only exceed (30 digits for decimal radix) in length for long, degenerate, initial seeds (sequence of "100 ones", etc.). For these extreme cases, individual elements of decimal sequences immediately settle into a permutation of the form where here the letters are placeholders for digit counts from the preceding sequence element.

Since the sequence is infinite, and the length of each element is bounded, it must eventually repeat, due to the pigeonhole principle. As a consequence, pea pattern sequences are always eventually periodic.

See also

References

  1. Conway. J. H.. John Horton Conway. The Weird and Wonderful Chemistry of Audioactive Decay. Eureka. January 1986. 46. 5–16. Reprinted asBook: Conway , J. H. . John Horton Conway . Cover . Thomas M. . Gopinath . B. . Open Problems in Communication and Computation . . 1987 . 173–188 . The Weird and Wonderful Chemistry of Audioactive Decay . 0-387-96621-8.
  2. Book: Roberts , Siobhan . Siobhan Roberts

    . Siobhan Roberts . Genius at Play: The Curious Mind of John Horton Conway . . 2015 . 978-1-62040-593-2.

  3. http://mathworld.wolfram.com/ConwaySequence.html Conway Sequence
  4. Look-and-Say Biochemistry: Exponential RNA and Multistranded DNA . Oscar . Martin . American Mathematical Monthly . 2006 . 113 . 4 . 289–307 . Mathematical association of America . 0002-9890 . https://web.archive.org/web/20061224154744/http://www.uam.es/personal_pdi/ciencias/omartin/Biochem.PDF . 2006-12-24 . January 6, 2010 . 10.2307/27641915. 27641915 .
  5. 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.
  6. Book: Vardi , Ilan . Computational Recreations in Mathematica . . 1991 . 0-201-52989-0.
  7. http://jamesthornton.com/fun/robert-morris-sequence.html Robert Morris Sequence
  8. https://web.archive.org/web/20110803133359/http://www.ocf.berkeley.edu/~stoll/number_sequence.html FAQ about Morris Number Sequence

External links