The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A105265 Concatenation of letters of words obtained from axiom "1" and the iterates of the substitutions '1' -> "12", '2' -> "3", '3' -> "4", '4' -> "1". 1
 1, 1, 2, 1, 2, 1, 2, 3, 1, 2, 1, 2, 3, 1, 2, 3, 1, 2, 3, 4, 1, 2, 1, 2, 3, 1, 2, 3, 1, 2, 3, 4, 1, 2, 3, 1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4, 1, 1, 2, 1, 2, 3, 1, 2, 3, 1, 2, 3, 4, 1, 2, 3, 1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4, 1, 1, 2, 3, 1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4, 1, 1, 2, 3, 4, 1, 2, 3, 4, 1, 1, 2, 3, 4 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS Let W() be the substitution defined above. If we define the sequence S(n) by S(0) = {1}, S(n+1) = S(n) + W(S(n)), then this sequence is the limiting sequence of S(n) as n approaches infinity. - Charlie Neder, Jul 11 2018 LINKS Charlie Neder, Table of n, a(n) for n = 0..9999 MATHEMATICA s[1] = {1, 2}; s[2] = {3}; s[3] = {4}; s[4] = {1}; t[a_] := Join[a, Flatten[s /@ a]]; p[0] = {1}; p[1] = t[{1}]; p[n_] := t[p[n - 1]] aa = p[6] CROSSREFS Cf. A073058. Sequence in context: A290532 A080237 A136109 * A351468 A193360 A061394 Adjacent sequences: A105262 A105263 A105264 * A105266 A105267 A105268 KEYWORD nonn,easy,less AUTHOR Roger L. Bagula, Apr 15 2005 EXTENSIONS New name from Joerg Arndt, Jul 14 2018 STATUS approved

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

Last modified December 7 10:26 EST 2022. Contains 358656 sequences. (Running on oeis4.)