|
%I #7 Dec 07 2015 10:53:28
%S 1,111,10011,1111011,100010011,11101111011,1001000010011,
%T 111111001111011,10000011100010011,1110001001101111011,
%U 100110111101000010011,11110100001011001111011,1000101100110011100010011,111011001110111001101111011,10010011100100011101000010011
%N Binary representation of the n-th iteration of the "Rule 86" 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="/A265280/b265280.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 = 86; 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. A071032.
%K nonn,easy
%O 0,2
%A _Robert Price_, Dec 06 2015
|
