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.

A056101 Number of 8-antichain covers of a labeled n-set.

This page as a plain text file.
%I A056101 #10 Feb 16 2025 08:32:43
%S A056101 115,1612560,4681922770,5933930926484,4603693881222819,
%T A056101 2608258836131076210
%N A056101 Number of 8-antichain covers of a labeled n-set.
%D A056101 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 A056101 V. Jovovic, G. Kilibarda, On enumeration of the class of all monotone Boolean functions, in preparation.
%H A056101 K. S. Brown, <a href="http://www.mathpages.com/home/kmath515.htm">Dedekind's problem</a>
%H A056101 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Cover.html">Antichain covers</a>
%Y A056101 Cf. A056046-A056049, A056052, A051116.
%K A056101 nonn
%O A056101 5,1
%A A056101 _Vladeta Jovovic_, Goran Kilibarda, Zoran Maksimovic, Jul 28 2000