Voozh

A381734

Population of elementary triangular automaton rule 190 at generation n, starting from a lone 1 cell at generation 0.

1, 4, 10, 19, 28, 37, 58, 73, 88, 115, 136, 163, 178, 247, 280, 307, 334, 391, 400, 463, 526, 595, 622, 679, 754, 811, 862, 925, 1036, 1057, 1168, 1249, 1318, 1321, 1468, 1531, 1618, 1723, 1840, 1939, 2032, 2155, 2230, 2323, 2572, 2617, 2722, 2785, 2926, 2935

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,2

COMMENTS

An Elementary Triangular Automaton (ETA) is a cellular automaton in the triangular grid where cells hold binary states and rules are local to the first neighborhood. There are 256 possible ETA rules.

Rule 190 (10111110 in binary):

-----------------------------------------------

|state of the cell |1|1|1|1|0|0|0|0|

|sum of the neighbors' states |3|2|1|0|3|2|1|0|

|cell's next state |1|0|1|1|1|1|1|0|

-----------------------------------------------

LINKS

Paul Cousin, Table of n, a(n) for n = 0..16384

Paul Cousin, Illustration for n = 0..64

Paul Cousin, Triangular Automata

Paul Cousin, Rule 190

Paul Cousin, Triangular Automata Integer Sequences