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”).
%I #13 Oct 05 2020 10:55:25
%S 0,1,1,0,0,1,1,0,0,1,0,1,0,1,1,0,0,1,1,0,0,1,0,1,0,1,1,0,0,1,0,1,1,0,
%T 0,1,0,1,1,0,0,1,1,0,0,1,0,1,0,1,1,0,0,1,1,0,0,1,0,1,0,1,1,0,0,1,0,1,
%U 1,0,0,1,0,1,1,0,0,1,1,0,0,1,0,1,0,1
%N Fixed point of the morphism 0 -> 01, 1 -> 1001.
%C This is a 3-automatic sequence. See Allouche et al. link. - _Michel Dekking_, Oct 05 2020
%H Clark Kimberling, <a href="/A284905/b284905.txt">Table of n, a(n) for n = 1..10000</a>
%H J.-P. Allouche, F. M. Dekking, and M. Queffélec, <a href="https://arxiv.org/abs/2010.00920">Hidden automatic sequences</a>, arXiv:2010.00920 [math.NT], 2020.
%H <a href="/index/Fi#FIXEDPOINTS">Index entries for sequences that are fixed points of mappings</a>
%e 0 -> 01-> 011001 -> 011001100101011001 ->
%t s = Nest[Flatten[# /. {0 -> {0, 1}, 1 -> {1, 0, 0, 1}}] &, {0}, 6] (* A284905 *)
%t Flatten[Position[s, 0]] (* A284906 *)
%t Flatten[Position[s, 1]] (* A284907 *)
%Y Cf. A284906, A284907.
%K nonn,easy
%O 1
%A _Clark Kimberling_, Apr 17 2017