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

Author

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

Keywords

• easy
• nonn
• fini
• full

Comments

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

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

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

Crossrefs

Cf. A102127, A102369, A274369, A274370.