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 A192098 #20 Oct 07 2013 01:01:29
%S A192098 5684,23772,69272,183960,391356,696178,941088,1182888,1150520,1165416,
%T A192098 815640,780570,413840,369180,178080,115780,43512,20734,6860,7098,3508,
%U A192098 574,840,665,476,210,28,1
%N A192098 Number of distinct (unordered) pairs of partitions of an 8-element set that have Rand distance n.
%C A192098 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 A192098 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 A192098 Cf. A192100 for set sizes 2..7.
%K A192098 nonn,fini,full
%O A192098 1,1
%A A192098 _Frank Ruskey_ and Yuji Yamauchi (eugene.uti(AT)gmail.com), Jul 21 2011