

A326352


Total number of black cells after n iterations of Langton's ant with two ants on the grid placed sidebyside with one empty square between them and initially looking in the same direction.


11



0, 2, 4, 6, 8, 6, 6, 6, 6, 8, 6, 8, 10, 12, 14, 12, 12, 12, 12, 14, 12, 12, 12, 12, 14, 12, 14, 16, 18, 20, 18, 18, 16, 16, 18, 16, 18, 20, 22, 24, 22, 22, 22, 22, 24, 22, 22, 22, 22, 24, 22, 24, 26, 28, 30, 28, 28, 26, 26, 28, 28, 30, 30, 32, 34, 34, 36, 34
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,2


COMMENTS

The two ants meet seven times; in that case, the color of the current square is flipped only once. Eventually, both ants build a recurrent highway pattern.  Rémy Sigrist, Jul 28 2019


LINKS



FORMULA

a(n + 104) = a(n) + 24 for any n >= 14373.  Rémy Sigrist, Jul 28 2019


EXAMPLE

See illustrations in Fröhlich, 2019.


PROG

(PARI) See Links section.


CROSSREFS



KEYWORD

nonn


AUTHOR



EXTENSIONS



STATUS

approved



