In this paper some results of L.
Carlitz and the writer concerning the number of binomial coefficients divisible by pj
but not by pj+1 are generalized to multinomial coefficients. In particular 𝜃j(k;n) is
defined to be the number of multinomial coefficients n|[n1,⋯,nk] divisible by exactly
pj, and formulas are found for 𝜃j(k;n) for certain values of j and n. Also the
generating function technique used by Carlitz for binomial coefficients is generalized
to multinomial coefficients.