# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/ Search: id:a192103 Showing 1-1 of 1 %I A192103 #18 Oct 07 2013 01:11:45 %S A192103 186300,887220,3060360,9883440,26969040,67288830,141778440,256463820, %T A192103 399874640,547907454,670419540,742419510,744780330,701747010, %U A192103 607809750,520591950,377521875,312082260,198307620,158606532,87210930,63688410,33243120,25703205,11343906,6764940,3272500,2003805,1532340,757080,211410,212625,198345,138600,82512,21080,16200,15750,14910,13545,7245,3270,630,45,1 %N A192103 Number of distinct (unordered) pairs of partitions of a 10-element set that have Rand distance n. %C A192103 The Rand distance of a pair of set partitions is the number of unordered pairs {x; y} such that there is a block in one partition containing both x and y, but x and y are in different blocks in the other partition. %H A192103 F. Ruskey and J. Woodcock, The Rand and block distances of pairs of set partitions, Combinatorial algorithms, 287-299, Lecture Notes in Comput. Sci., 7056, Springer, Heidelberg, 2011. %Y A192103 Cf. A192100 for set sizes 2..7. A192098 and A192102 for set sizes 8 and 9. %K A192103 nonn,fini,full %O A192103 1,1 %A A192103 _Frank Ruskey_ and Yuji Yamauchi (eugene.uti(AT)gmail.com), Aug 08 2011 # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE