login
A308184
S_oo, where S_1 = bc, S_n = S_{n-1} a^n S_{n-1} for n > 1, over the alphabet {a,b,c} = {1,2,3}.
1
2, 3, 1, 1, 2, 3, 1, 1, 1, 2, 3, 1, 1, 2, 3, 1, 1, 1, 1, 2, 3, 1, 1, 2, 3, 1, 1, 1, 2, 3, 1, 1, 2, 3, 1, 1, 1, 1, 1, 2, 3, 1, 1, 2, 3, 1, 1, 1, 2, 3, 1, 1, 2, 3, 1, 1, 1, 1, 2, 3, 1, 1, 2, 3, 1, 1, 1, 2, 3, 1, 1, 2, 3, 1, 1, 1, 1, 1, 1, 2, 3, 1, 1, 2, 3, 1, 1, 1, 2, 3, 1, 1, 2, 3, 1, 1, 1, 1, 2, 3, 1, 1, 2, 3, 1, 1, 1
OFFSET
1,1
COMMENTS
This infinite word is recurrent (but not uniformly recurrent) and contains arbitrarily long palindromes, but its set of factors is not closed under reversal.
LINKS
M. Bucci, A. De Luca, A. Glen, L. Q. Zamboni, A connection between palindromic and factor complexity using return words, arXiv:0802.1332 [math.CO], 2008. See Section 4.
CROSSREFS
Cf. A308183.
Sequence in context: A266743 A284050 A308644 * A114280 A123564 A036466
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Jun 05 2019
STATUS
approved