login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A094867 Number of unique iterations required to generate emergent regular squares using LQTL logic. 3
4, 8, 32, 64, 416, 832 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

Subsequent emergent behavior at greater than 832 iterations becomes symmetrically random.

Arises in the context of cellular automata with emergent behavior (cf. Langton's Ant).

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.

PROG

(Ant Farm algorithm available from R. H. Barbour)

CROSSREFS

Cf. A094266, A102110.

Sequence in context: A229953 A291938 A094015 * A149093 A149094 A086344

Adjacent sequences:  A094864 A094865 A094866 * A094868 A094869 A094870

KEYWORD

easy,nonn,fini

AUTHOR

Robert H Barbour and J. Chapman, Jun 15 2004

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 25 20:10 EDT 2019. Contains 321477 sequences. (Running on oeis4.)