login
A317951
An S-automatic sequence for the system S = (a*b*, {a,b}, a<b).
0
0, 1, 4, 2, 4, 4, 3, 4, 4, 4, 0, 4, 4, 4, 4, 1, 4, 4, 4, 4, 4, 2, 4, 4, 4, 4, 4, 4, 3, 4, 4, 4, 4, 4, 4, 4, 0, 4, 4, 4, 4, 4, 4, 4, 4, 1, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 0, 4, 4, 4, 4, 4, 4, 4, 4
OFFSET
0,3
LINKS
Michel Rigo and Arnaud Maes, More on generalized automatic sequences, Journal of Automata, Languages and Combinatorics 7.3 (2002): 351-376. See Fig. 1.
FORMULA
a(A000217(k)) = A010873(k) for any k; all other terms are equal to 4. - Andrey Zabolotskiy, Aug 20 2018
CROSSREFS
Cf. other sequences from Rigo & Maes: A010060, A010052, A317948.
Sequence in context: A053051 A075234 A232715 * A095382 A135282 A347409
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Aug 19 2018
EXTENSIONS
Terms a(37) and beyond from Andrey Zabolotskiy, Aug 20 2018
STATUS
approved