Number of 4-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=4.

A027559

Number of 4-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=4.

Terms

    a(0) =1a(1) =2a(2) =4a(3) =8a(4) =16a(5) =30a(6) =58a(7) =106a(8) =200a(9) =360a(10) =668a(11) =1190a(12) =2182a(13) =3858a(14) =7012a(15) =12328a(16) =22256a(17) =38958a(18) =69962a(19) =122042a(20) =218248a(21) =379656a(22) =676636a(23) =1174390a(24) =2087222a(25) =3615906a(26) =6411716a(27) =11090504a(28) =19627984a(29) =33907134

External references