A squarefree sequence: define a mapping from the set of strings over the alphabet {0,1,2} by f(0)=01201, f(1)=020121, f(2)=0212021 and f of the concatenation of s and t is the concatenation of f(s) and f(t). Then each of 0, f(0), f(f(0)), ... is an initial substring of the next; their limit is the infinite sequence given above.

A086713

A squarefree sequence: define a mapping from the set of strings over the alphabet {0,1,2} by f(0)=01201, f(1)=020121, f(2)=0212021 and f of the concatenation of s and t is the concatenation of f(s) and f(t). Then each of 0, f(0), f(f(0)), ... is an initial substring of the next; their limit is the infinite sequence given above.

Terms

    a(0) =0a(1) =1a(2) =2a(3) =0a(4) =1a(5) =0a(6) =2a(7) =0a(8) =1a(9) =2a(10) =1a(11) =0a(12) =2a(13) =1a(14) =2a(15) =0a(16) =2a(17) =1a(18) =0a(19) =1a(20) =2a(21) =0a(22) =1a(23) =0a(24) =2a(25) =0a(26) =1a(27) =2a(28) =1a(29) =0

External references