|
%I #16 Feb 21 2016 16:35:59
%S 1,0,10101,0,101111101,10001000,1010001000101,1000100000,
%T 10111000100011101,1010100010101000,101000000010000000101,
%U 111110001111100000,1011101000101010001011101,101000100000001000101000,10100000100011111000100000101,11100010100010100011100000
%N Binary representation of the n-th iteration of the "Rule 73" elementary cellular automaton starting with a single black cell.
%D S. Wolfram, A New Kind of Science, Wolfram Media, 2002; p. 55.
%H Robert Price, <a href="/A265122/b265122.txt">Table of n, a(n) for n = 0..999</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/ElementaryCellularAutomaton.html">Elementary Cellular Automaton</a>
%H S. Wolfram, <a href="http://wolframscience.com/">A New Kind of Science</a>
%H <a href="/index/Ce#cell">Index entries for sequences related to cellular automata</a>
%H <a href="https://oeis.org/wiki/Index_to_Elementary_Cellular_Automata">Index to Elementary Cellular Automata</a>
%e From _Michael De Vlieger_, Dec 02 2015: (Start)
%e 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:
%e 0 1 -> 1
%e 1 0 0 0 -> 0
%e 0 1 0 1 0 1 -> 10101
%e 1 0 0 0 0 0 0 0 -> 0
%e 0 1 0 1 1 1 1 1 0 1 -> 101111101
%e 1 0 0 0 1 0 0 0 1 0 0 0 -> 10001000
%e 0 1 0 1 0 0 0 1 0 0 0 1 0 1 -> 1010001000101
%e 1 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 -> 1000100000
%e 0 1 0 1 1 1 0 0 0 1 0 0 0 1 1 1 0 1 -> 10111000100011101
%e (End)
%t 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}]
%Y Cf. A245549.
%K nonn,easy
%O 0,3
%A _Robert Price_, Dec 01 2015
| 