A026610 a(n) = number of 1's between n-th 2 and (n+1)st 2 in A026600.
0, 2, 0, 2, 1, 1, 1, 0, 1, 2, 1, 1, 1, 0, 2, 0, 2, 1, 1, 0, 2, 0, 2, 0, 2, 1, 0, 2, 1, 1, 1, 0, 2, 0, 2, 1, 1, 0, 2, 0, 2, 0, 2, 1, 1, 0, 2, 0, 2, 1, 1, 1, 0, 2, 1, 0, 2, 0, 2, 0, 2, 1, 1, 0, 2, 0, 2, 1, 1, 1, 0, 1, 2, 1, 1, 1, 0, 2, 0, 2, 0, 2, 1, 1, 1, 0, 2, 0, 2, 1
Offset: 1
Keywords
Examples
delta(B)=02, since there is no 11, 21, or 31 between B(1)=12 and B(3)=32, and there is twice a 31 among B(4)=23,...,B(7)=31.
References
- J.-P. Allouche and J. Shallit, Automatic Sequences, Cambridge Univ. Press, 2003.
Links
- Michael De Vlieger, Table of n, a(n) for n = 1..19683
- Jacques Justin and Laurent Vuillon, Return words in Sturmian and episturmian words, RAIRO-Theoretical Informatics and Applications 34.5 (2000): 343-356.
Programs
-
Mathematica
Rest@ Map[Count[#, 1] &, DeleteCases[SplitBy[#, # == 2 &], ?(# == {2} &)]] &@ Nest[Flatten[# /. {1 -> {1, 2, 3}, 2 -> {2, 3, 1}, 3 -> {3, 1, 2}}] &, {1}, 6] (* _Michael De Vlieger, Apr 16 2019, after Robert G. Wilson v at A026600 *)
Comments