A093693 a(n) is chosen so as to maximize the number of different substrings in (a(1),a(2),...,a(n)) (in base 3).

0, 1, 2, 0, 0, 2, 1, 0, 0, 0, 1, 1, 0, 1, 0, 2, 2, 0, 1, 0, 0, 1, 0, 1, 1, 1, 2, 1, 1, 0, 0, 2, 0, 2, 0, 0, 0, 0, 2, 2, 1, 2, 2, 2, 0, 0, 1, 2, 1, 0, 1, 2, 2, 0, 2, 1, 1, 1, 0, 2, 0, 1, 1, 2, 0, 1, 2, 0, 2, 2, 2, 1, 0, 2, 1, 2, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 2, 0, 1, 0, 1, 0, 0, 2, 1, 1, 2, 2, 1, 1, 0, 1, 1, 0, 0