|
%I #15 Feb 10 2019 17:27:10
%S 1,1,1,1,1,2,0,0,1,1,3,0,2,1,1,1,1,4,0,0,3,0,0,0,1,1,5,0,4,3,3,3,0,1,
%T 1,1,1,6,0,0,7,0,0,0,0,2,0,0,1,1,7,0,6,7,7,7,0,0,2,2,2,1,1,1,1,8,0,0,
%U 13,0,0,0,7,2,4,0,0,0,0,0
%N Triangle read by rows giving successive states of cellular automaton generated by "Rule 30", with accumulating cell values
%C First take the sum of the values of the left neighbor, the cell itself, and the right neighbor. The next value of the cell will equal this sum if the value of the left neighbor is zero, or if the cell and its right neighbor are both zero.
%C In other cases the next value of the cell will be zero.
%C The pattern of nonzero cells is the same as the rule 30 CA (A070950), but the cell values grow as the CA progresses.
%H Nathan M Epstein, <a href="https://i.imgur.com/ExTyd8L.png">Color visualization of A323179</a>
%e Triangle begins:
%e 1
%e 1, 1, 1
%e 1, 2, 0, 0, 1
%e 1, 3, 0, 2, 1, 1, 1
%e 1, 4, 0, 0, 3, 0, 0, 0, 1
%Y Min(a(n), 1) = A070950(n).
%K nonn,tabf
%O 0,6
%A _Nathan M Epstein_, Jan 10 2019
|
