login
A323179
Triangle read by rows giving successive states of cellular automaton generated by "Rule 30", with accumulating cell values
2
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, 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, 13, 0, 0, 0, 7, 2, 4, 0, 0, 0, 0, 0
OFFSET
0,6
COMMENTS
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.
In other cases the next value of the cell will be zero.
The pattern of nonzero cells is the same as the rule 30 CA (A070950), but the cell values grow as the CA progresses.
EXAMPLE
Triangle begins:
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
CROSSREFS
Min(a(n), 1) = A070950(n).
Sequence in context: A025881 A039804 A277537 * A320508 A164925 A334546
KEYWORD
nonn,tabf
AUTHOR
Nathan M Epstein, Jan 10 2019
STATUS
approved