|
%I #8 Dec 07 2015 14:39:02
%S 1,110,11100,1101000,111110000,11000100000,1110011000000,
%T 110101110000000,11111110100000000,1100000111000000000,
%U 111000011010000000000,11010001111100000000000,1111100110001000000000000,110001011100110000000000000,11100111101011100000000000000
%N Binary representation of the n-th iteration of the "Rule 110" 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="/A265320/b265320.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 = 110; 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. A075437.
%K nonn,easy
%O 0,2
%A _Robert Price_, Dec 06 2015
|
