This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A193317 #22 Apr 17 2015 14:37:34
%S A193317 0,0,1,18,300,5550,117780,2873262,80126228,2534723280,90239747220,
%T A193317 3588582531875,158318375911740,7700793136255440,410691133882551795,
%U A193317 23894146232727414630,1509723335738373490800,103169903975944947302744,7597003720932150826636260,600748548233457344454385722
%N A193317 Binomial(n,2)*B(n-1)*(B(n)-B(n-1)), where B() = A000110() are the Bell numbers.
%C A193317 Sum of the Rand distance over all unordered pairs of partitions.
%H A193317 Frank Ruskey and Jennifer Woodcock, <a href="http://dx.doi.org/10.1007/978-3-642-25011-8_23">The Rand and block distances of pairs of set partitions</a>, Combinatorial algorithms, 287-299, Lecture Notes in Comput. Sci., 7056, Springer, Heidelberg, 2011.
%t A193317 Table[Binomial[n, 2]*BellB[n - 1] (BellB[n] - BellB[n - 1]), {n, 19}] (* _Michael De Vlieger_, Apr 16 2015 *)
%Y A193317 Cf. A000110, A191200.
%Y A193317 Equals half A124104.
%K A193317 nonn
%O A193317 0,4
%A A193317 _N. J. A. Sloane_, Aug 26 2011