275577domain: NAppears in sequencesMin{m: n = Sum((m mod (1+k*L(n)!))*2^(k-1): 1<=k<=L(n))}, where L(n) = length of binary representation of n, cf. A070939, A000142.at n=11A094096Number of ternary strings of length 2*n that have more 0's than the combined number of 1's and 2's.at n=7A386670