%I #14 Aug 04 2018 11:23:26

%S 2,2,0,2,0,1,2,1,0,1,2,0,2,1,0,2,0,1,2,0,2,1,0,1,2,1,0,2,0,1,2,1,0,1,

%T 2,0,2,1,0,1,2,1,0,2,0,1,2,0,2,1,0,2,0,1,2,1,0,1,2,0,2,1,0,2,0,1,2,0,

%U 2,1,0,1,2,1,0,2,0,1,2,0,2,1,0,2,0,1,2

%N An example of a word that is uniform morphic, but neither pure morphic, primitive morphic, nor recurrent.

%H Jack W Grahl, <a href="/A316344/b316344.txt">Table of n, a(n) for n = 0..999</a>

%H Jean-Paul Allouche, Julien Cassaigne, Jeffrey Shallit, Luca Q. Zamboni, <a href="https://arxiv.org/abs/1711.10807">A Taxonomy of Morphic Sequences</a>, arXiv preprint arXiv:1711.10807 [cs.FL], Nov 29 2017. See Example 24.

%H Jack W Grahl, <a href="/A316344/a316344.hs.txt">Haskell code to generate this sequence</a>

%Y Sequences mentioned in the Allouche et al. "Taxonomy" paper, listed by example number: 1: A003849, 2: A010060, 3: A010056, 4: A020985 and A020987, 5: A191818, 6: A316340 and A273129, 18: A316341, 19: A030302, 20: A063438, 21: A316342, 22: A316343, 23: A003849 minus its first term, 24: A316344, 25: A316345 and A316824, 26: A020985 and A020987, 27: A316825, 28: A159689, 29: A049320, 30: A003849, 31: A316826, 32: A316827, 33: A316828, 34: A316344, 35: A043529, 36: A316829, 37: A010060.

%Y Cf. A036577.

%K nonn,easy

%O 0,1

%A _N. J. A. Sloane_, Jul 14 2018

%E More terms from _Jack W Grahl_, Jul 23 2018