a(n) is the least n-bit number k such that k has the maximum number of distinct (nonempty) substrings in the binary representation of k.

A391787

a(n) is the least n-bit number k such that k has the maximum number of distinct (nonempty) substrings in the binary representation of k.

Terms

    a(0) =0a(1) =2a(2) =4a(3) =9a(4) =19a(5) =35a(6) =70a(7) =139a(8) =278a(9) =558a(10) =1070a(11) =2140a(12) =4253a(13) =8503a(14) =17006a(15) =34007a(16) =68014a(17) =136028a(18) =272060a(19) =534204a(20) =1068408a(21) =2133369a(22) =4266362a(23) =8532669a(24) =17065338a(25) =34130555a(26) =68261103a(27) =136522206a(28) =273044399a(29) =546088798

External references