A308973 Langton's ant on a truncated square tiling: number of black cells after n moves of the ant when starting on an octagon and looking towards an edge where the tile meets another octagon.
0, 1, 2, 3, 4, 5, 6, 5, 6, 7, 8, 9, 8, 7, 8, 9, 10, 11, 10, 11, 10, 9, 10, 11, 12, 13, 14, 15, 14, 15, 16, 17, 18, 17, 16, 17, 18, 17, 16, 17, 18, 19, 20, 21, 22, 21, 22, 23, 24, 23, 22, 23, 24, 25, 26, 27, 28, 27, 28, 29, 30, 29, 28, 29, 30, 31, 32, 33, 34
Offset: 0
Keywords
Examples
See illustrations in Fröhlich, 2019.
Links
- Rémy Sigrist, Table of n, a(n) for n = 0..500
- Felix Fröhlich, Illustration of iterations 0-50 of the ant, 2019.
- Rémy Sigrist, Configuration after 100 steps
- Rémy Sigrist, PARI program for A308973
- Wikipedia, Langton's ant
- Wikipedia, Truncated square tiling
Programs
-
PARI
See Links section.
Formula
a(n + 12) = a(n) + 6 for any n >= 34. - Rémy Sigrist, Jul 21 2019
Extensions
More terms from Rémy Sigrist, Jul 21 2019
Comments