a(n) is chosen so as to maximize the number of different substrings in (a(1),a(2),...,a(n)) (in base 2).
A093692
a(n) is chosen so as to maximize the number of different substrings in (a(1),a(2),...,a(n)) (in base 2).
Terms
- a(0) =0a(1) =1a(2) =1a(3) =0a(4) =0a(5) =0a(6) =1a(7) =0a(8) =1a(9) =1a(10) =1a(11) =0a(12) =1a(13) =0a(14) =0a(15) =1a(16) =1a(17) =1a(18) =1a(19) =0a(20) =0a(21) =1a(22) =0a(23) =0a(24) =0a(25) =0a(26) =1a(27) =1a(28) =0a(29) =1
External references
- oeis: A093692