A317203 - OEIS

%I #21 May 28 2021 11:05:30

%S 3,1,3,2,3,1,3,1,3,2,3,1,3,2,3,1,3,1,3,2,3,1,3,1,3,2,3,1,3,2,3,1,3,1,

%T 3,2,3,1,3,2,3,1,3,1,3,2,3,1,3,1,3,2,3,1,3,2,3,1,3,1,3,2,3,1,3,1,3,2,

%U 3,1,3,2,3,1,3,1,3,2,3,1,3,2,3,1,3,1,3,2,3,1,3,1,3,2,3,1,3

%N Fixed under the morphism 1 -> 132, 2 -> 1, 3 -> 3, starting with 31.

%C a(n) = Pi(A108103(n+2)), where Pi is the permutation Pi(1)=3, Pi(2)=2, Pi(3)=1. For a proof, see my link. - _Michel Dekking_, Dec 28 2019

%H Michel Dekking, <a href="/A317203/b317203.txt">Table of n, a(n) for n = 1..1199</a>

%H Michel Dekking, <a href="/A317203/a317203_1.pdf">A317203-A108103-connection</a>

%H Jacques Justin, and Giuseppe Pirillo, <a href="https://doi.org/10.1016/S0304-3975(01)00207-9">Episturmian words and episturmian morphisms</a>, Theoretical Computer Science, 276.1-2 (2002): 281-313. See Remark 3.2.

%K nonn

%O 1,1

%A _N. J. A. Sloane_, Aug 05 2018

%E Definition amended by _Georg Fischer_, May 28 2021