cp's OEIS Frontend

An antichain is a set of nonempty sets, none of which is a subset of any other.

The vertex-connectivity of a set-system is the minimum number of vertices that must be removed (along with any resulting empty edges) to obtain a non-connected set-system or singleton. Note that this means a single node has vertex-connectivity 0.

A binary index of n is any position of a 1 in its reversed binary expansion. The binary indices of n are row n of A048793. We define the set-system with BII-number n to be obtained by taking the binary indices of each binary index of n. Every set-system (finite set of finite nonempty sets of positive integers) has a different BII-number. For example, 18 has reversed binary expansion (0,1,0,0,1), and since the binary indices of 2 and 5 are {2} and {1,3} respectively, the BII-number of {{2},{1,3}} is 18. Elements of a set-system are sometimes called edges.

A set-system is an antichain if no edge is a proper subset of any other.

For n > 1, a(n) appears to be the number whose binary indices are the first n terms of A018900.

A binary index of n is any position of a 1 in its reversed binary expansion. The binary indices of n are row n of A048793. We define the set-system with BII-number n to be obtained by taking the binary indices of each binary index of n. Every set-system (finite set of finite nonempty sets of positive integers) has a different BII-number. For example, 18 has reversed binary expansion (0,1,0,0,1), and since the binary indices of 2 and 5 are {2} and {1,3} respectively, the BII-number of {{2},{1,3}} is 18. Elements of a set-system are sometimes called edges.

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798. The multiset of multisets with MM-number n is formed by taking the multiset of prime indices of each part of the multiset of prime indices of n. For example, the prime indices of 78 are {1,2,6}, so the multiset of multisets with MM-number 78 is {{},{1},{1,2}}.

In an antichain of sets, no edge is a proper subset of any other.

An antichain is a set of nonempty sets, none of which is a subset of any other. A singleton is considered to be connected.

An antichain is a set of sets, none of which is a subset of any other. It is covering if there are no isolated vertices.

An antichain is a set of nonempty sets, none of which is a subset of any other. A singleton is considered to be connected.

The dual of a multiset partition has, for each vertex, one block consisting of the indices (or positions) of the blocks containing that vertex, counted with multiplicity. For example, the dual of {{1,2},{2,2}} is {{1},{1,2,2}}.

The weight of a multiset partition is the sum of sizes of its parts. Weight is generally not the same as number of vertices.

From Gus Wiseman, Aug 15 2019: (Start)

Also the number of non-isomorphic T_0 weak antichains of weight n. The T_0 condition means that the dual is strict (no repeated edges). A weak antichain is a multiset of multisets, none of which is a proper submultiset of any other. For example, non-isomorphic representatives of the a(0) = 1 through a(4) = 15 T_0 weak antichains are:

{} {{1}} {{1,1}} {{1,1,1}} {{1,1,1,1}}

{{1},{1}} {{1,2,2}} {{1,2,2,2}}

{{1},{2}} {{1},{2,2}} {{1,1},{1,1}}

{{1},{1},{1}} {{1,1},{2,2}}

{{1},{2},{2}} {{1},{2,2,2}}

{{1},{2},{3}} {{1,2},{2,2}}

{{1},{2,3,3}}

{{1,3},{2,3}}

{{1},{1},{2,2}}

{{1},{2},{3,3}}

{{1},{1},{1},{1}}

{{1},{1},{2},{2}}

{{1},{2},{2},{2}}

{{1},{2},{3},{3}}

{{1},{2},{3},{4}}

(End)

An antichain is a set of sets, none of which is a subset of any other.

The vertex-connectivity of a set-system is the minimum number of vertices that must be removed (along with any resulting empty edges) to obtain a non-connected set-system or singleton. Note that this means a single node has vertex-connectivity 0.