We determine the cardinal numbers of the sets of words of $n$-length over any m-member alphabet in which any fixed subword of length three is forbidden. Cardinal numbers can be calculated in two ways, which for accurately determined values of the parameter $m$ consequently gives some new combination identities and some interesting limits.