若干相同元不相邻的重复n排列的计算及应用

Enumeration of Repeated Permutations in Which No Element May appear in Neighboring Position by Itself

本文议论了r个元中有s个元不许与自身在相邻位置的重复n排列，并应用此结果，解决了2×n广义棋盘染色的计数问题.

This paper deals with the protlems of enumenation of repeated permutations in which no elememt may appear in neighboring position by itself. As an application of the former reult, we discuss with the problems of enumeration of the coloring of z ×n generalized chess boards.