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 A192104 #19 May 13 2017 15:27:15
%S A192104 1163085,5835060,21482340,74471760,222185304,612903720,1469224350,
%T A192104 3164268690,5762811670,9538994388,13513772745,18112131840,20675910420,
%U A192104 23653643310,22677991578,22923998460,19287053775,17554312490,13495597225,11143736604,8029798920,6035010960,4254456690,2872892550,1924619235,1215058680,789847190
%N A192104 Number of distinct (unordered) pairs of partitions of an 11-element set that have Rand distance n.
%C A192104 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 A192104 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 A192104 Cf. A192100 for set sizes 2..7. A192098, A192102 and A192103 for set sizes 8..10.
%K A192104 nonn,fini
%O A192104 1,1
%A A192104 _Frank Ruskey_ and Yuji Yamauchi (eugene.uti(AT)gmail.com), Aug 08 2011