Number of length-n binary sequences whose subword complexity is <= 2i, for all i.

Terms

a(0) =1a(1) =2a(2) =4a(3) =8a(4) =16a(5) =32a(6) =64a(7) =128a(8) =256a(9) =472a(10) =856a(11) =1494a(12) =2494a(13) =4060a(14) =6460a(15) =10002a(16) =15170a(17) =22492a(18) =32596a(19) =46824a(20) =66076a(21) =91716a(22) =125784a(23) =170582a(24) =227426a(25) =302210a(26) =396144a(27) =514540a(28) =663740a(29) =850580