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

A027560

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

Terms

    a(0) =1a(1) =2a(2) =4a(3) =8a(4) =16a(5) =32a(6) =62a(7) =122a(8) =232a(9) =450a(10) =846a(11) =1622a(12) =3026a(13) =5748a(14) =10664a(15) =20106a(16) =37144a(17) =69608a(18) =128164a(19) =238984a(20) =438826a(21) =814874a(22) =1492908a(23) =2762562a(24) =5051602a(25) =9320014a(26) =17014950a(27) =31311964a(28) =57084732a(29) =104819474

External references