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

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

Offset: 0

Author

Eric W. Weisstein, Apr 13 2006

Keywords

• nonn
• tabf

Comments

Row n has length 2*n+1. - Hans Havermann, May 26 2002

Examples

			From _Michael De Vlieger_, Aug 21 2020: (Start)
Irregular array begins:
0:                             1
1:                          1  1  1
2:                       1  1  1  0  1
3:                    1  1  1  0  1  1  1
4:                 1  1  1  0  1  1  1  0  1
5:              1  1  1  0  1  1  1  0  1  1  1
6:           1  1  1  0  1  1  1  0  1  1  1  0  1
7:        1  1  1  0  1  1  1  0  1  1  1  0  1  1  1
8:     1  1  1  0  1  1  1  0  1  1  1  0  1  1  1  0  1
9:  1  1  1  0  1  1  1  0  1  1  1  0  1  1  1  0  1  1  1
... (End)
		

Links

• Robert Price, Table of n, a(n) for n = 0..9999
• Eric Weisstein's World of Mathematics, Rule 190
• 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. A265688 (binary rows), A037576 (decimal rows), A032766 (num 1's).

Programs

Mathematica

With[{nn = 9}, MapIndexed[#1[[#2 + 1 ;; 2 nn - #2 + 1]] & @@ {#1, nn - First[#2] + 1} &, CellularAutomaton[190, {{1}, 0}, nn]]] // Flatten (* Michael De Vlieger, Aug 21 2020 *)