A102358 Finite sequence of iterations at which Langton's Ant passes through the origin.

0, 4, 8, 16, 52, 60, 96, 140, 184, 276, 368, 376, 384, 392, 428, 436, 472, 656, 660, 3412, 4144, 4152, 6168, 6764, 8048, 8052, 8056, 8060, 8068

Offset

1,2

Comments

Numbers n such that A274369(n) = A274370(n) = 0. - Felix Fröhlich, Jul 26 2016

References

Christopher G. Langton et al., (1990) Artificial Life II. Addison-Wesley, Reading, MA., USA

Links

Table of n, a(n) for n=1..29.

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

Prog

Ant Farm algorithm available from bbarbour(AT)unitec.ac.nz

Crossrefs

Cf. A102127, A102369, A274369, A274370.

Sequence in context: A077447 A337783 A301773 * A038238 A230112 A023376

Adjacent sequences: A102355 A102356 A102357 * A102359 A102360 A102361

Keyword

easy,nonn,fini,full

Author

Robert H Barbour, Feb 21 2005, corrected Feb 27 2005

Status

approved