54242domain: NAppears in sequencesNumber 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.at n=20A027557Numbers whose set of base-15 digits is {1,2}.at n=31A032935Row sums of A154685.at n=36A151675