A124104 Sum of the Rand distance between all pairs of set partitions of {1, 2, ... n}.
0, 2, 36, 600, 11100, 235560, 5746524, 160252456, 5069446560, 180479494440, 7177165063750, 316636751823480, 15401586272510880, 821382267765103590, 47788292465454829260, 3019446671476746981600, 206339807951889894605488
Offset: 1
Keywords
Examples
E.g. a(2) = 2 = 1 + 1 + 0 + 0 because the distance from 1,2 to 12 is 1 (and vice versa) and the distance from 1,2 to 1,2 or 12 to 12 is 0.
Links
- V. Filkov and S. Skiena, Integrating microarray data by consensus clustering, (see also doi: 10.1142/S0218213004001867 or 10.1109/TAI.2003.1250220).
- A. Goder and V. Filkov, Consensus clustering algorithms: Comparison and refinement, Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments, 2008, 109-117.
- W. Rand, Objective criteria for the evaluation of clustering methods, J. Amer. Stat. Assoc., 66 (336): 846-850, 1971.
Crossrefs
Equals twice A193317.
Programs
-
Mathematica
Table[2 Binomial[n, 2]*BellB[n - 1] (BellB[n] - BellB[n - 1]), {n, 17}] (* Michael De Vlieger, Apr 16 2015 *)
Formula
a(n) = 2 * binomial(n,2) * Bell(n-1) * (Bell(n) - Bell(n-1)).
a(n) ~ n*LambertW(n)*Bell(n)^2 * (1 - LambertW(n)/n). - Vaclav Kotesovec, Jul 28 2021
Comments