|
%I #13 Feb 21 2016 17:11:56
%S 1,11,11,110011,10011,1110110011,1000010011,11011110110011,
%T 11000010011,111110001110110011,111011001000010011,
%U 1100100001011110110011,101111010011000010011,11101001100110001110110011,10011000100011001000010011,110110001101110001011110110011
%N Binary representation of the n-th iteration of the "Rule 149" elementary cellular automaton starting with a single ON (black) cell.
%D S. Wolfram, A New Kind of Science, Wolfram Media, 2002; p. 55.
%H Robert Price, <a href="/A265715/b265715.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 14 2015: (Start)
%e First 10 rows, replacing leading zeros with ".", the row converted to its binary equivalent at right:
%e 1 -> 1
%e . 1 1 -> 11
%e . . . 1 1 -> 11
%e . 1 1 0 0 1 1 -> 110011
%e . . . . 1 0 0 1 1 -> 10011
%e . 1 1 1 0 1 1 0 0 1 1 -> 1110110011
%e . . . 1 0 0 0 0 1 0 0 1 1 -> 1000010011
%e . 1 1 0 1 1 1 1 0 1 1 0 0 1 1 -> 11011110110011
%e . . . . . . 1 1 0 0 0 0 1 0 0 1 1 -> 11000010011
%e . 1 1 1 1 1 0 0 0 1 1 1 0 1 1 0 0 1 1 -> 111110001110110011
%e (End)
%t rule = 149; 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. A265246.
%K nonn,easy
%O 0,2
%A _Robert Price_, Dec 14 2015
| 