摘要
This paper is on a distribution question of Ⅰ type in the combinatorics (see: 'Ke Zhao, Wei WanDi, combinatorial theory, science press, 1981. '). Suppose n distrinct balls, m distinct boxes. The capacity set of every box is Now,place the n balls into the m boxes. Thenumber of distinct placed ways is expressed by , and simply by And it is called the distribution number.Main result is:Theorem The exponential generating function of sequence isThus .there is the recurrence relationhere (integer set).
