|
%I #7 Dec 14 2015 11:27:17
%S 1,110,11000,1100110,110010000,11001101110,1100100001000,
%T 110011011110110,11001000011000000,1100110111000111110,
%U 110010000100110111000,11001101111010000100110,1100100001100101111010000,110011011100011001100101110,11001000010011000100011001000
%N Binary representation of the n-th iteration of the "Rule 135" 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="/A265696/b265696.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 <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>
%t rule = 135; 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. A265695.
%K nonn,easy
%O 0,2
%A _Robert Price_, Dec 13 2015
|
