%I #57 Jul 26 2024 21:02:25
%S 1,0,0,0,1,0,1,0,1,0,0,0,0,0,0,0,1,0,1,1,1,1,1,0,1,0,0,0,1,0,0,0,1,0,
%T 0,0,1,0,1,0,0,0,1,0,0,0,1,0,1,0,0,0,0,0,1,0,0,0,1,0,0,0,0,0,1,0,1,1,
%U 1,0,0,0,1,0,0,0,1,1,1,0,1,0,0,0,1,0
%N Triangle read by rows giving successive states of cellular automaton generated by "Rule 73" 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="/A262448/b262448.txt">Table of n, a(n) for n = 0..9999</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>
%e 1; 0,0,0; 1,0,1,0,1; 0,0,0,0,0,0,0; 1,0,1,1,1,1,1,0,1; ...
%t rule = 73; rows = 20; Flatten[Table[Take[CellularAutomaton[rule, {{1},0}, rows-1, {All, All}][[k]], {rows - k + 1, rows + k - 1}], {k, 1, rows}]]
%Y Cf. A070950.
%K nonn,tabf,easy
%O 0
%A _Robert Price_, Nov 28 2015