Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #18 Oct 07 2013 01:03:08
%S 31572,141624,452508,1341648,3266172,7234374,12259368,18992502,
%T 23324140,28129626,26605908,26190612,21568932,17119818,13040280,
%U 8948079,6244308,3679032,2431044,1250109,640908,315828,197568,57288,46116,30366,25732,7695,4104,2226,3780,2205,1344,378,36,1
%N Number of distinct (unordered) pairs of partitions of a 9-element set that have Rand distance n.
%C 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 F. Ruskey and J. Woodcock, <a href="http://webhome.cs.uvic.ca/~ruskey/Publications/RandDist/RandDist.html">The Rand and block distances of pairs of set partitions</a>, Combinatorial algorithms, 287-299, Lecture Notes in Comput. Sci., 7056, Springer, Heidelberg, 2011.
%Y Cf. A192100 for set sizes 2..7. A192098 for set size 8.
%K nonn,fini,full
%O 1,1
%A _Frank Ruskey_ and Yuji Yamauchi (eugene.uti(AT)gmail.com), Aug 08 2011