|
Search: id:A138036
|
|
|
| A138036 |
|
From a substitution sequence of Veikko Keronen: "From http://south.rotol.ramk.fi/~keranen/Forssa/UsingTheEmptySet.html (.nb) the reader may find examples of computer algebra programs in which we pay special attention to handling the empty set. Indeed, in our study, the empty set (or the empty word) is many times a natural starting point and the meticulous use of it supports us to keep the programs clear and reliable. In many cases the computation also ends with the empty set as a result. For example, the reader may try the following Mathematica program which starts, in a sense, from {{}} and ends with {}"..."Indeed, this computation shows that Abelian squares are unavoidable over 3 letters, since every word of length 8 turns out to contain them. Originally, this style of programming arose in discussions with Stephen Wolfram and our program above is a modified version of the example that Wolfram presents in [35, p. 944].". |
|
+0
1
|
|
| 0, 1, 2, 0, 1, 0, 2, 1, 0, 1, 2, 2, 0, 2, 1, 0, 1, 0, 0, 1, 2, 0, 2, 0, 0, 2, 1, 1, 0, 1, 1, 0, 2, 1, 2, 0, 1, 2, 1, 2, 0, 1, 2, 0, 2, 2, 1, 0, 2, 1, 2, 0, 1, 0, 2, 0, 1, 2, 0, 0, 1, 2, 1, 0, 2, 0, 1, 0, 2, 1, 0, 0, 2, 1, 2, 1, 0, 1, 2, 1, 0, 2, 0, 1, 0, 2, 1, 1, 2, 0, 1, 1, 2, 0, 2, 1, 2, 1, 0, 2, 0, 1, 0, 2, 0
(list; graph; listen)
|
|
|
Search completed in 0.001 seconds
|
