In previous papers we examined two functions f_m and c_m, related to the enumeration of restricted words over a finite alphabet. The definitions of these functions depend on an initial arithmetic function f₀ taking nonnegative integer values. In this paper, we consider four types of initial functions, the values of which are binomial coefficients. In particular, we give a new combinatorial interpretation of the figurate numbers.