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.

Showing 1-2 of 2 results.

A327426 Number of non-connected, unlabeled, antichain covers of {1..n} (vertex-connectivity 0).

Original entry on oeis.org

1, 1, 1, 2, 6, 23, 201, 16345
Offset: 0

Views

Author

Gus Wiseman, Sep 11 2019

Keywords

Comments

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. A singleton is not considered connected.
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.

Examples

			Non-isomorphic representatives of the a(2) = 1 through a(5) = 23 antichains:
    {1}{2}  {1}{23}    {1}{234}         {1}{2345}
            {1}{2}{3}  {12}{34}         {12}{345}
                       {1}{2}{34}       {1}{2}{345}
                       {1}{24}{34}      {1}{23}{45}
                       {1}{2}{3}{4}     {12}{35}{45}
                       {1}{23}{24}{34}  {1}{25}{345}
                                        {1}{2}{3}{45}
                                        {1}{245}{345}
                                        {1}{2}{35}{45}
                                        {1}{2}{3}{4}{5}
                                        {1}{24}{35}{45}
                                        {1}{25}{35}{45}
                                        {12}{34}{35}{45}
                                        {1}{24}{25}{345}
                                        {1}{23}{245}{345}
                                        {1}{2}{34}{35}{45}
                                        {1}{235}{245}{345}
                                        {1}{23}{24}{35}{45}
                                        {1}{25}{34}{35}{45}
                                        {1}{23}{24}{25}{345}
                                        {1}{234}{235}{245}{345}
                                        {1}{24}{25}{34}{35}{45}
                                        {1}{23}{24}{25}{34}{35}{45}
		

Crossrefs

Column k = 0 of A327359.
The labeled version is A120338.
The non-covering version is A327424 (partial sums).

Formula

a(n > 1) = A261005(n) - A261006(n).

A327808 Number of unlabeled, disconnected, nonempty antichains of subsets of {1..n}.

Original entry on oeis.org

0, 0, 1, 3, 9, 32, 233, 16578
Offset: 0

Views

Author

Gus Wiseman, Sep 26 2019

Keywords

Comments

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

Examples

			Non-isomorphic representatives of the a(2) = 1 through a(4) = 9 antichains:
   {{1},{2}}  {{1},{2}}      {{1},{2}}
              {{1},{2,3}}    {{1},{2,3}}
              {{1},{2},{3}}  {{1},{2},{3}}
                             {{1},{2,3,4}}
                             {{1,2},{3,4}}
                             {{1},{2},{3,4}}
                             {{1},{2},{3},{4}}
                             {{2},{1,3},{1,4}}
                             {{4},{1,2},{1,3},{2,3}}
		

Crossrefs

The labeled version is A327354 - 1.
The covering case is A327426.
Unlabeled antichains that are either not connected or not covering are A327437.
The version with empty antichains allowed is A327424.

Formula

a(n) = A327424(n) - 1.
Showing 1-2 of 2 results.