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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A102358 Finite sequence of iterations at which Langton's Ant passes through the origin. 7
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; refs; listen; history; text; internal format)
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: A065978 A077447 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

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 December 14 17:44 EST 2019. Contains 329979 sequences. (Running on oeis4.)