A326352 - OEIS

%I #23 Jul 12 2021 16:55:45

%S 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,

%T 16,18,20,18,18,16,16,18,16,18,20,22,24,22,22,22,22,24,22,22,22,22,24,

%U 22,24,26,28,30,28,28,26,26,28,28,30,30,32,34,34,36,34

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

%C 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

%H Rémy Sigrist, <a href="/A326352/b326352.txt">Table of n, a(n) for n = 0..20000</a>

%H Felix Fröhlich, <a href="/A326352/a326352.pdf">Illustration of iterations 0-50</a>, 2019.

%H Rémy Sigrist, <a href="/A326352/a326352.png">Representation of the grid after 20000 iterations</a>

%H Rémy Sigrist, <a href="/A326352/a326352.gp.txt">PARI program for A326352</a>

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Langton%27s_ant">Langton's ant</a>

%F a(n + 104) = a(n) + 24 for any n >= 14373. - _Rémy Sigrist_, Jul 28 2019

%e See illustrations in Fröhlich, 2019.

%o (PARI) See Links section.

%Y Cf. A255938, A269757, A308590, A325953, A325954, A325955, A326167, A326353.

%K nonn

%O 0,2

%A _Felix Fröhlich_, Jun 30 2019

%E More terms from _Rémy Sigrist_, Jul 28 2019