|
COMMENTS
|
Number of permutations of a multiset that contains n different elements, each occurring 9 times.
Or in other words (the former title of this sequence):
Number of 9*n X n 0..1 arrays with row sums 1 and column sums 9.
(End)
|
|
EXAMPLE
|
a(3) = (9*3)!/(9!^3) = 227873431500 is the number of permutations of a multiset that contains 3 different elements, each occurring 9 times, e.g., {1,1,1,1,1,1,1,1,1,2,2,2,2,2,2,2,2,2,3,3,3,3,3,3,3,3,3}.
|