login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A103957 The Rauzy Markov nest of nests substitution is done upon the Hofstadter A005185 sequence. 0
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; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

In which the Markov recursion is made to work on another sequential function that is chaotic as a Hofstadter sequence is used which skips domain elements, "holes" in the sequence are made at 0 and 7.

LINKS

Table of n, a(n) for n=0..104.

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: A233284 A112195 A103956 * A232550 A305426 A322811

Adjacent sequences:  A103954 A103955 A103956 * A103958 A103959 A103960

KEYWORD

nonn,uned

AUTHOR

Roger L. Bagula, Mar 30 2005

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 16:16 EDT 2019. Contains 322430 sequences. (Running on oeis4.)