A118174 Binary representation of n-th iteration of the Rule 188 elementary cellular automaton starting with a single black cell.

1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0

Offset: 0

Author

Eric W. Weisstein, Apr 13 2006

Keywords

• nonn
• easy
• tabf

Examples

			Triangle starts:
            1;
         0, 1, 1;
      0, 0, 1, 0, 1;
   0, 0, 0, 1, 1, 1, 1;
0, 0, 0, 0, 1, 1, 1, 0, 1;
...
		

Links

• Robert Price, Table of n, a(n) for n = 0..9999
• Eric Weisstein's World of Mathematics, Rule 188
• Eric Weisstein's World of Mathematics, Elementary Cellular Automaton
• S. Wolfram, A New Kind of Science
• Index entries for sequences related to cellular automata
• Index to Elementary Cellular Automata

Crossrefs

Cf. A118173, decimal representation.

Cf. A265428, total number of ON cells in n-th iteration.

Cf. A265429, total number of ON cells after n iterations.

Cf. A265430, total number of OFF cells in n-th iteration.

Cf. A265431, total number of OFF cells after n iterations.

Programs

Mathematica

lim = 10; a = {}; Do[AppendTo[a, Table[0, k - 1]~Join~Take[#[[k]], k]], {k, Length@ #}] &@ CellularAutomaton[188, {{1}, 0}, lim]; Flatten@ a (* Michael De Vlieger, Dec 09 2015 *)