login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A005681
A squarefree quaternary sequence.
(Formerly M0934)
4
2, 4, 3, 2, 3, 1, 2, 4, 3, 1, 2, 3, 2, 4, 3, 2, 3, 1, 2, 3, 2, 4, 3, 1, 2, 4, 3, 2, 3, 1, 2, 4, 3, 1, 2, 3, 2, 4, 3, 1, 2, 4, 3, 2, 3, 1, 2, 3, 2, 4, 3, 2, 3, 1, 2, 4, 3, 1, 2, 3, 2, 4, 3, 2, 3, 1, 2, 3, 2, 4, 3, 1, 2, 4, 3, 2, 3, 1, 2, 3, 2, 4, 3, 2, 3, 1, 2, 4, 3, 1, 2, 3, 2, 4, 3, 1, 2, 4, 3, 2, 3, 1, 2, 4, 3, 1, 2, 3, 2, 4, 3, 2, 3, 1, 2
OFFSET
1,1
COMMENTS
This is an automatic sequence, fixed point starting with 2 of the morphism mu: 1->23, 2->24, 3->31, 4->32. The morphism mu is the 2-block morphism of the Thue-Morse morphism. An instance of this sequence on the alphabet {0,1,2,3} is equal to A245188. - Michel Dekking, Feb 18 2021
REFERENCES
A. Salomaa, Jewels of Formal Language Theory. Computer Science Press, Rockville, MD, 1981, p. 10.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
F. Michel Dekking, Morphisms, Symbolic Sequences, and Their Standard Forms, Journal of Integer Sequences, Vol. 19 (2016), Article 16.1.1.
FORMULA
a(n) = s(A001285(n), A001285(n+1)) where s(1,1)=1, s(1,2)=2, s(2,1)=3, s(2,2)=4. - Sean A. Irvine, Aug 04 2016
CROSSREFS
KEYWORD
nonn
STATUS
approved