%I #6 Jan 02 2016 03:58:37

%S 1,10,1111,1010000,1101101,11010110110,1111011011,111010001101100,

%T 1101010110001,1111010111111001010,1111000000011111,

%U 11111010000111110100000,1101101000011011101,111111010110110110101100110,1111011011011110001011,1111111010001101101100001011100

%N Binary representation of the n-th iteration of the "Rule 45" elementary cellular automaton starting with a single ON (black) cell.

%D S. Wolfram, A New Kind of Science, Wolfram Media, 2002; p. 55.

%H G. C. Greubel, <a href="/A266621/b266621.txt">Table of n, a(n) for n = 0..249</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>

%t rule=45; rows=20; ca=CellularAutomaton[rule,{{1},0},rows-1,{All,All}]; (* Start with single black cell *) catri=Table[Take[ca[[k]],{rows-k+1,rows+k-1}],{k,1,rows}]; (* Truncated list of each row *) Table[FromDigits[catri[[k]]],{k,1,rows}] (* Binary Representation of Rows *)

%Y Cf. A266619.

%K nonn,easy

%O 0,2

%A _Robert Price_, Jan 01 2016