438826domain: NAppears in sequencesNumber 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.at n=20A027560a(n) = floor[geometric mean of first n factorials].at n=15A090901Numbers k that have 13 terms in their Zeckendorf representation.at n=19A179253