OFFSET
1
COMMENTS
The morphism 0->10, 1-> 0110 has two limiting words. If the number of iterations is even, the 0-word evolves from 0 -> 10 -> 011010 -> 100110011010011010 -> 011010100110011010100110011010011010100110011010011010; if the number of iterations is odd, the 1-word evolves from 0 -> 10 -> 011010 -> 100110011010011010, as in A285258.
This is a 3-automatic sequence. See Allouche et al. link. - Michel Dekking, Oct 05 2020
LINKS
Clark Kimberling, Table of n, a(n) for n = 1..10000
J.-P. Allouche, F. M. Dekking, and M. Queffélec, Hidden automatic sequences, arXiv:2010.00920 [math.NT], 2020.
MATHEMATICA
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Apr 23 2017
STATUS
approved