This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A049321 Primitive Chacon sequence: fixed under 0->0012, 1->12, 2->012. 2
 0, 0, 1, 2, 0, 0, 1, 2, 1, 2, 0, 1, 2, 0, 0, 1, 2, 0, 0, 1, 2, 1, 2, 0, 1, 2, 1, 2, 0, 1, 2, 0, 0, 1, 2, 1, 2, 0, 1, 2, 0, 0, 1, 2, 0, 0, 1, 2, 1, 2, 0, 1, 2, 0, 0, 1, 2, 0, 0, 1, 2, 1, 2, 0, 1, 2, 1, 2, 0, 1, 2, 0, 0, 1, 2, 1, 2, 0, 1, 2, 1, 2, 0, 1, 2, 0, 0, 1, 2, 1, 2, 0, 1, 2, 0, 0, 1, 2, 0, 0, 1, 2, 1, 2, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 LINKS Reinhard Zumkeller, Table of n, a(n) for n = 0..10000 Scott Balchin and Dan Rust, Computations for Symbolic Substitutions, Journal of Integer Sequences, Vol. 20 (2017), Article 17.4.1. S. Ferenczi, Complexity of sequences and dynamical systems, Discrete Math., 206 (1999), 145-154. MATHEMATICA Nest[Flatten[# /. {0 -> {0, 0, 1, 2}, 1 -> {1, 2}, 2 -> {0, 1, 2}}]&, {0}, 4] (* Jean-François Alcover, Oct 05 2016 *) PROG (Haskell) a049321 n = a049321_list !! n a049321_list = 0 : 0 : 1 : 2 : f [0, 0, 1, 2] where    f xs = drop (length xs) ys ++ f ys where      ys = concatMap ch xs      ch 0 = [0, 0, 1, 2]; ch 1 = [1, 2]; ch 2 = [0, 1, 2] -- Reinhard Zumkeller, Aug 14 2013 CROSSREFS Cf. A003849, A049320. Sequence in context: A024942 A210255 A283319 * A204425 A245187 A292598 Adjacent sequences:  A049318 A049319 A049320 * A049322 A049323 A049324 KEYWORD nonn,nice,easy AUTHOR EXTENSIONS More terms from Larry Reeves (larryr(AT)acm.org), Apr 12 2000 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.

Last modified October 13 19:35 EDT 2019. Contains 327981 sequences. (Running on oeis4.)