A094867 Number of iterations of the LQTL cellular automaton required to generate a square of cells in identical states.

4, 8, 32, 64, 416, 832

Offset

0,1

Comments

For the definition of the LQTL CA, see A102127. The square of size 1 on iteration 1 is not included.

Links

Table of n, a(n) for n=0..5.

P. Sarkar, A Brief History of Cellular Automata, ACM Computing Surveys, Vol. 32, No. 1, March 2000.

Example

After step a(5) = 832 of the cellular automaton, the nonempty cells form a 8x8 square, all cells in state 2.

Crossrefs

Cf. A094266, A102110, A204810.

Sequence in context: A291938 A358046 A094015 * A149093 A149094 A086344

Adjacent sequences: A094864 A094865 A094866 * A094868 A094869 A094870

Keyword

nonn,fini

Author

Robert H Barbour and J. Chapman, Jun 15 2004

Extensions

Edited by Andrey Zabolotskiy, Nov 05 2023

Status

approved