Number of 3-balanced strings of length n: let d(S)= #(1)'s in S - #(0)'s, then S is k-balanced if every substring T has -k<=d(T)<=k; here k=3.

A027557

Number of 3-balanced strings of length n: let d(S)= #(1)'s in S - #(0)'s, then S is k-balanced if every substring T has -k<=d(T)<=k; here k=3.

Terms

    a(0) =1a(1) =2a(2) =4a(3) =8a(4) =14a(5) =26a(6) =44a(7) =78a(8) =130a(9) =224a(10) =370a(11) =626a(12) =1028a(13) =1718a(14) =2810a(15) =4656a(16) =7594a(17) =12506a(18) =20356a(19) =33374a(20) =54242a(21) =88640a(22) =143906a(23) =234594a(24) =380548a(25) =619238a(26) =1003882a(27) =1631312a(28) =2643386a(29) =4291082

External references