|
%I #8 Sep 22 2013 07:58:54
%S 1,5,25,173,20335,45999
%N Total number of different ways to fill m labeled boxes with balls which belong to the specifications provided by all the integer partitions [n] of n. Empty boxes are not allowed. Total number of possible preferential arrangements (or hierarchical orderings) of n elements if the elements may belong to c=1 up to c=n different classes (or specifications).
%D John Riordan: Introduction to combinatorics New York, unabridged republication of the edition published by John Wiley & Sons, New York, 1958, ISBN 0-486-42536-3.
%D Percy A. MacMahon: Combinatorial Analysis, Volumes I, II bound in one volume, Chelsea Publishing Company, New York, 1960, Reprint of the two volumes published 1915, 1916 by Cambridge University Press, Library of Congress Catalog Card No. 59-10267.
%Y Cf. A000079, A000670.
%K nonn
%O 1,2
%A _Thomas Wieder_, Apr 09 2008
|
