|
%I #10 Jul 27 2016 03:10:41
%S 0,4,8,16,52,60,96,140,184,276,368,376,384,392,428,436,472,656,660,
%T 3412,4144,4152,6168,6764,8048,8052,8056,8060,8068
%N Finite sequence of iterations at which Langton's Ant passes through the origin.
%C Numbers n such that A274369(n) = A274370(n) = 0. - _Felix Fröhlich_, Jul 26 2016
%D Christopher G. Langton et al., (1990) Artificial Life II. Addison-Wesley, Reading, MA., USA
%H P. Sarkar, <a href="http://dx.doi.org/10.1145/349194.349202">A Brief History of Cellular Automata</a>, ACM Computing Surveys. Vol. 32 No. 1 March (2000).
%o Ant Farm algorithm available from bbarbour(AT)unitec.ac.nz
%Y Cf. A102127, A102369, A274369, A274370.
%K easy,nonn,fini,full
%O 1,2
%A _Robert H Barbour_, Feb 21 2005, corrected Feb 27 2005
|
