This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A316344 #28 Jul 17 2025 09:36:47
%S A316344 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 A316344 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 A316344 2,1,0,1,2,1,0,2,0,1,2,0,2,1,0,2,0,1,2
%N A316344 An example of a word that is uniform morphic, but neither pure morphic, primitive morphic, nor recurrent.
%H A316344 Zhuorui He, <a href="/A316344/b316344.txt">Table of n, a(n) for n = 0..10000</a> (first 1000 terms from Jack W Grahl)
%H A316344 Jean-Paul Allouche, Julien Cassaigne, Jeffrey Shallit, and 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 A316344 Jack W Grahl, <a href="/A316344/a316344.hs.txt">Haskell code to generate this sequence</a>
%F A316344 From _Zhuorui He_, Jul 11 2025: (Start)
%F A316344 a(n) = A010060(2*n+2) + A010060(max(2*n+1,4)).
%F A316344 a(n) = A036577(n+1) except a(1) = 2. (End)
%t A316344 Join[{2, 2}, Differences[ThueMorse[Range[2, 100]]] + 1] (* _Paolo Xausa_, Jul 17 2025 *)
%Y A316344 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 A316344 Cf. A036577.
%K A316344 nonn,easy
%O A316344 0,1
%A A316344 _N. J. A. Sloane_, Jul 14 2018
%E A316344 More terms from _Jack W Grahl_, Jul 23 2018