Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #23 Nov 08 2023 11:17:39
%S 1,1,2,1,1,2,2,1,1,2,1,1,2,2,2,1,1,2,1,1,2,2,1,1,2,1,1,2,2,2,2,1,1,2,
%T 1,1,2,2,1,1,2,1,1,2,2,2,1,1,2,1,1,2,2,1,1,2,1,1,2,2,2,2,2,1,1,2,1,1,
%U 2,2,1,1,2,1,1,2,2,2,1,1,2,1,1,2,2,1,1
%N Fixed point (beginning with a) of the morphism a -> aab, b -> b, over the alphabet {a,b} = {1,2}.
%H Rémy Sigrist, <a href="/A308188/b308188.txt">Table of n, a(n) for n = 1..16383</a>
%H M. Bucci, A. De Luca, A. Glen and L. Q. Zamboni, <a href="https://arxiv.org/abs/0802.1332">A connection between palindromic and factor complexity using return words</a>, arXiv:0802.1332 [math.CO], 2008. See Section 4.
%t Nest[Flatten[ReplaceAll[#,1->{1,1,2}]]&,{1},6] (* _Paolo Xausa_, Nov 08 2023 *)
%o (PARI) w = [1]; while (#w<63, w=concat(apply(t -> [[1,1,2],[2]][t], w))); print (w) \\ _Rémy Sigrist_, Nov 01 2021
%Y Cf. A079559 (as 1,0), A308187 (as 0,1).
%Y Cf. A308185, A308186.
%K nonn
%O 1,3
%A _N. J. A. Sloane_, Jun 05 2019
%E More terms from _Rémy Sigrist_, Nov 01 2021