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 A037843 #10 Jun 13 2013 14:37:21
%S A037843 2,3,7,39,2551,22928343,6641112790058484007
%N A037843 Number of matrices with n columns whose rows do not cover each other; ordered antichains of subsets of an n-set.
%D A037843 V. Jovovic and G. Kilibarda, On the number of Boolean functions in the Post classes F^{mu}_8, Diskretnaya Matematika, 11 (1999), no. 4, 127-138 (translated in Discrete Mathematics and Applications, 9, (1999), no. 6)
%D A037843 V. Jovovic, G. Kilibarda, On enumeration of the class of all monotone Boolean functions, in preparation.
%H A037843 K. S. Brown, <a href="http://www.mathpages.com/home/kmath515.htm">Dedekind's problem</a>
%H A037843 <a href="/index/Bo#Boolean">Index entries for sequences related to Boolean functions</a>
%F A037843 a(n)=Sum_{k=0..C(n, floor(n/2))}k!*M(n, k) where M(n, k) is the number of distinct monotone Boolean functions of n variables with k mincuts.
%Y A037843 Cf. A003182, A051112-A051117, A007411, A006602.
%K A037843 hard,nonn
%O A037843 0,1
%A A037843 _Vladeta Jovovic_, Goran Kilibarda, Jul 23 2000