Maximal number of distinct nonempty substrings of any binary string of length n.

A094913

Maximal number of distinct nonempty substrings of any binary string of length n.

Terms

    a(0) =0a(1) =1a(2) =3a(3) =5a(4) =8a(5) =12a(6) =16a(7) =21a(8) =27a(9) =34a(10) =42a(11) =50a(12) =59a(13) =69a(14) =80a(15) =92a(16) =105a(17) =119a(18) =134a(19) =150a(20) =166a(21) =183a(22) =201a(23) =220a(24) =240a(25) =261a(26) =283a(27) =306a(28) =330

External references