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

A093691

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

Terms

    a(0) =0a(1) =1a(2) =2a(3) =3a(4) =4a(5) =5a(6) =6a(7) =7a(8) =8a(9) =9a(10) =0a(11) =0a(12) =2a(13) =0a(14) =3a(15) =0a(16) =4a(17) =0a(18) =5a(19) =0a(20) =6a(21) =0a(22) =7a(23) =0a(24) =8a(25) =0a(26) =9a(27) =1a(28) =0a(29) =0

External references