|
Search: id:A103957
|
|
|
| A103957 |
|
The Rauzy Markov nest of nests substitution is done upon the Hofstadter A005185 sequence. |
|
+0
1
|
|
| 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 2, 1, 2, 1, 3, 1, 1, 2, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 3, 1, 2, 1, 3, 1, 2, 1, 3, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 3, 1, 2, 1, 3, 1, 2, 1, 3, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 3, 1, 2, 1, 3, 1, 2, 1, 3, 1, 2, 1, 1, 2, 1, 2, 1, 3, 1, 2, 1, 3, 1, 2
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
In which the Markov recursion is made to work on another sequential function that is chaotic as an Hofstadter sequence is used which skips domain elements, "holes" in the sequence are made at 0 and 7.
|
|
FORMULA
|
1-> {1, 2) 2->{1, 3} 3->1 Nested Nest of substitution list are taken in a chaotic order.
|
|
MATHEMATICA
|
Hofstadter[n_Integer? Positive] := Hofstadter[n] = Hofstadter[n - Hofstadter[n - 1]] + \ Hofstadter[n - Hofstadter[n - 2]] Hofstadter[0] = Hofstadter[1] = 1 s[1] = {1, 2}; s[2] = {1, 3}; s[3] = {1}; t[a_] := Join[a, Flatten[s /@ a]]; p[0] = {1}; p[1] = t[{1}]; p[n_] := t[p[n - 1]] aa = Flatten[Table[p[If[n > 0, Conway[n], n]], {n, 0, 7}]]
|
|
CROSSREFS
|
Cf. A073058, A103684, A005185.
Sequence in context: A152828 A112195 A103956 this_sequence A091853 A091304 A049847
Adjacent sequences: A103954 A103955 A103956 this_sequence A103958 A103959 A103960
|
|
KEYWORD
|
nonn,uned
|
|
AUTHOR
|
Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Mar 30 2005
|
|
|
Search completed in 0.002 seconds
|
