%I
%S 1,1,0,0,1,0,0,1,0,1,0,0,1,0,0,0,1,0,0,1,0,0,1,1,0,1,0,0,1,0,0,1,0,0,
%T 0,0,1,0,0,1,0,0,1,0,0,1,1,1,0,1,0,0,1,0,0,1,0,0,1,0,1,0,0,0,1,0,0,1,
%U 0,0,1,0,0,1,0,0,0,0,1,1,0,1,0,0,1,0
%N Triangle read by rows giving successive states of cellular automaton generated by "Rule 131" initiated with a single ON (black) cell.
%C Row n has length 2n+1.
%D S. Wolfram, A New Kind of Science, Wolfram Media, 2002; p. 55.
%H Robert Price, <a href="/A267418/b267418.txt">Table of n, a(n) for n = 0..10000</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 The first ten rows:
%e 1
%e 1 0 0
%e 1 0 0 1 0
%e 1 0 0 1 0 0 0
%e 1 0 0 1 0 0 1 1 0
%e 1 0 0 1 0 0 1 0 0 0 0
%e 1 0 0 1 0 0 1 0 0 1 1 1 0
%e 1 0 0 1 0 0 1 0 0 1 0 1 0 0 0
%e 1 0 0 1 0 0 1 0 0 1 0 0 0 0 1 1 0
%e 1 0 0 1 0 0 1 0 0 1 0 0 1 1 1 0 0 0 0
%t rule=131; rows=20; ca=CellularAutomaton[rule,{{1},0},rows1,{All,All}]; (* Start with single black cell *) catri=Table[Take[ca[[k]],{rowsk+1,rows+k1}],{k,1,rows}]; (* Truncated list of each row *) Flatten[catri] (* Triangle Representation of CA *)
%K nonn,tabf,easy
%O 0
%A _Robert Price_, Jan 14 2016
