|
%I #24 Nov 06 2023 02:04:37
%S 4,8,32,64,416,832
%N Number of iterations of the LQTL cellular automaton required to generate a square of cells in identical states.
%C For the definition of the LQTL CA, see A102127. The square of size 1 on iteration 1 is not included.
%H P. Sarkar, <a href="https://doi.org/10.1145/349194.349202">A Brief History of Cellular Automata</a>, ACM Computing Surveys, Vol. 32, No. 1, March 2000.
%e After step a(5) = 832 of the cellular automaton, the nonempty cells form a 8x8 square, all cells in state 2.
%Y Cf. A094266, A102110, A204810.
%K nonn,fini
%O 0,1
%A _Robert H Barbour_ and J. Chapman, Jun 15 2004
%E Edited by _Andrey Zabolotskiy_, Nov 05 2023
|
