A265122 Binary representation of the n-th iteration of the "Rule 73" elementary cellular automaton starting with a single ON (black) cell.

1, 0, 10101, 0, 101111101, 10001000, 1010001000101, 1000100000, 10111000100011101, 1010100010101000, 101000000010000000101, 111110001111100000, 1011101000101010001011101, 101000100000001000101000, 10100000100011111000100000101, 11100010100010100011100000

Offset: 0

Author

Robert Price, Dec 01 2015

Keywords

• nonn
• easy

Examples

			From _Michael De Vlieger_, Dec 02 2015: (Start)
First 8 rows, showing surrounding context at left, cells generated by the initial cell at center, and the binary equivalent at right where leading zeros are lost:
0                   1                 ->                 1
1                 0 0 0               ->                 0
0               1 0 1 0 1             ->             10101
1             0 0 0 0 0 0 0           ->                 0
0           1 0 1 1 1 1 1 0 1         ->         101111101
1         0 0 0 1 0 0 0 1 0 0 0       ->          10001000
0       1 0 1 0 0 0 1 0 0 0 1 0 1     ->     1010001000101
1     0 0 0 0 0 1 0 0 0 1 0 0 0 0 0   ->        1000100000
0   1 0 1 1 1 0 0 0 1 0 0 0 1 1 1 0 1 -> 10111000100011101
(End)
		

References

• S. Wolfram, A New Kind of Science, Wolfram Media, 2002; p. 55.

Links

• Robert Price, Table of n, a(n) for n = 0..999
• 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. A245549.

Programs

Mathematica

rule = 73; rows = 20; Table[FromDigits[Table[Take[CellularAutomaton[rule,{{1},0}, rows-1, {All,All}][[k]], {rows-k+1, rows+k-1}], {k,1,rows}][[k]]], {k,1,rows}]