Number of length-n binary strings achieving the maximum possible subword complexity.

Terms

a(0) =2a(1) =2a(2) =6a(3) =8a(4) =4a(5) =36a(6) =42a(7) =48a(8) =40a(9) =16a(10) =558a(11) =718a(12) =854a(13) =920a(14) =956a(15) =960a(16) =912a(17) =704a(18) =256a(19) =79006a(20) =107152a(21) =140502a(22) =177840a(23) =218652a(24) =259266a(25) =297280a(26) =330560a(27) =358048a(28) =378616a(29) =381664