|
Search: id:A102358
|
|
|
| A102358 |
|
Finite sequence of iterations at which Langton's Ant passes through the origin. |
|
+0
3
|
|
| 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
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
Christopher G. Langton et al., (1990) Artificial Life II. Addison-Wesley, Reading, MA., USA
P. Sarkar, A Brief History of Cellular Automata. ACM Computing Surveys. Vol. 32 No. 1 March, 2000.
|
|
PROGRAM
|
Ant Farm algorithm available from bbarbour(AT)unitec.ac.nz
|
|
CROSSREFS
|
Cf. A102127, A102369.
Sequence in context: A065605 A065978 A077447 this_sequence A038238 A023376 A038110
Adjacent sequences: A102355 A102356 A102357 this_sequence A102359 A102360 A102361
|
|
KEYWORD
|
easy,nonn,fini,full
|
|
AUTHOR
|
R. H. Barbour (bbarbour(AT)unitec.ac.nz), Feb 21 2005, corrected Feb 27 2005
|
|
|
Search completed in 0.002 seconds
|
