An identity which has some interesting combinatorial interpretations is proved. A bijection is established between a set of strings over the alphabet $B=\{0,1,2,3\}$ and the set of ail symmetric monotone functions of $n$ variables over the three-valued logic algebra. As a consequence, a simple formula for the number of such functions is obtained. A different proof of this formula is given in [2].