cp's OEIS Frontend

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.

A056104 Number of 9-antichain covers of a labeled n-set.

This page as a plain text file.
%I A056104 #10 Feb 16 2025 08:32:43
%S A056104 20,1484110,15936368770,59961701958816,121740972715475096,
%T A056104 167109117756164222210,176340421320592288902670,
%U A056104 154794453668193645059165412,118987888829384136293188343172
%N A056104 Number of 9-antichain covers of a labeled n-set.
%D A056104 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 A056104 V. Jovovic, G. Kilibarda, On enumeration of the class of all monotone Boolean functions, in preparation.
%H A056104 K. S. Brown, <a href="http://www.mathpages.com/home/kmath515.htm">Dedekind's problem</a>
%H A056104 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Cover.html">Antichain covers</a>
%Y A056104 Cf. A056046-A056049, A056052, A051112-A051118.
%K A056104 nonn
%O A056104 6,1
%A A056104 _Vladeta Jovovic_, Goran Kilibarda, Zoran Maksimovic, Jul 29 2000