%I A094867
%S A094867 4,8,32,64,416,832
%N A094867 Number of unique iterations required to generate emergent regular squares 
               using LQTL logic. Subsequent emergent behavior at greater than 832 
               iterations becomes symmetrically random.
%C A094867 Arises in the context of cellular automata with emergent behavior (cf. 
               Langton's Ant).
%D A094867 Sarkar P. (2000), A Brief History of Cellular Automata. ACM Computing 
               Surveys. Vol. 32 No. 1 March.
%o A094867 Ant Farm algorithm available from R. H. Barbour
%Y A094867 Cf. A094266, A102110.
%Y A094867 Sequence in context: A034041 A050442 A094015 this_sequence A149093 A149094 
               A086344
%Y A094867 Adjacent sequences: A094864 A094865 A094866 this_sequence A094868 A094869 
               A094870
%K A094867 easy,nonn,fini
%O A094867 0,1
%A A094867 R. H. Barbour (bbarbour(AT)unitec.ac.nz) and J. Chapman, Jun 15 2004