%I #10 Jan 10 2017 08:07:14
%S 1,-3,2,1,3,-2,1,-3,2,-1,3,2,1,-3,2,1,3,-2,1,3,2,-1,3,-2,1,-3,2,1,3,
%T -2,1,-3,2,-1,3,2,1,-3,2,-1,3,-2,1,3,2,-1,3,2,1,-3,2,1,3,-2,1,-3,2,-1,
%U 3,2,1,-3,2,1,3,-2,1,3,2,-1,3,-2,1,-3,2,1,3,-2
%N The Tower of Hanoi word, with a,b,c,a-bar,b-bar,c-bar encoded as 1,2,3,-1,-2,-3 respectively.
%C Writing A,B,C for a-bar,b-bar,c-bar, respectively, the word is aCbacBaCbAcbaCbacBacbAcBaCbacBaCbAcbaCbAcBacbAcbaCbacBaCbAcbaCbacBacbAcBaCbacB...
%H Lars Blomberg, <a href="/A280048/b280048.txt">Table of n, a(n) for n = 0..10000</a>
%H J. Berstel et al., <a href="http://bookstore.ams.org/crmm-27">Combinatorics on Words: Christoffel Words and Repetitions in Words</a>, AMS, 2009; see Definition 2.29, page 92.
%K sign
%O 0,2
%A _N. J. A. Sloane_, Dec 31 2016
%E More terms from _Lars Blomberg_, Jan 09 2017