A198514 - OEIS

A198514

Consider a cellular automaton on the square grid where we start at time 1 with a finite collection of cells in state 1 and with all cells in state 0. At any time t, if a cell is in state 0 and the sum of the states of its neighborhood is t, the cell switches to state t. At any time t, if no cell switches to state t, the growth stops. The sequence gives the largest lifetime of any configuration starting from n cells which are rook connected.

%I #14 Aug 13 2020 14:02:28

%S 1,3,6,9,11,22,22,23,29,29,35,36,36

%N Consider a cellular automaton on the square grid where we start at time 1 with a finite collection of cells in state 1 and with all cells in state 0. At any time t, if a cell is in state 0 and the sum of the states of its neighborhood is t, the cell switches to state t. At any time t, if no cell switches to state t, the growth stops. The sequence gives the largest lifetime of any configuration starting from n cells which are rook connected.

%H Erich Friedman, <a href="https://erich-friedman.github.io/mathmagic/0902.html">Problem of the month September 2002</a>

%e The solution for n=4

%e 9 9

%e 85 4 58

%e 32 23

%e 6311136

%e 313

%e 74 47

%e 8

%Y Cf. A198515, A198516.

%K nonn,more

%O 1,2

%A _Kausthub Gudipati_, Oct 26 2011