In this talk, we study the number of distinct distributions of substrings of
length $l$ appeared in binary sequences of length $n$ in order to obtain some
properties included in individual sequence. Furthermore, we list up the number
of distinct compositions of substrings of length $l$ appeared in binary
sequences of length $n$ for small range of $n, l$. In addition, we show a trick
to compute the distribution of substrings of length $l$ in each of $d$-ary
sequences of length $n.