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.
Discussion
Thu Sep 08
08:44
OEIS Server: https://oeis.org/edit/global/2944
Discussion
Sat Apr 29
03:37
Michel Marcus: with a space