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-4 of 4 results.

A326572 Number of covering antichains of subsets of {1..n}, all having different sums.

Original entry on oeis.org

2, 1, 2, 8, 80, 3015, 803898
Offset: 0

Views

Author

Gus Wiseman, Jul 18 2019

Keywords

Comments

An antichain is a finite set of finite sets, none of which is a subset of any other. It is covering if its union is {1..n}. The edge-sums are the sums of vertices in each edge, so for example the edge sums of {{1,3},{2,5},{3,4,5}} are {4,7,12}.

Examples

			The a(0) = 2 through a(3) = 8 antichains:
  {}    {{1}}  {{1,2}}    {{1,2,3}}
  {{}}         {{1},{2}}  {{1},{2,3}}
                          {{2},{1,3}}
                          {{1,2},{1,3}}
                          {{1,2},{2,3}}
                          {{1},{2},{3}}
                          {{1,3},{2,3}}
                          {{1,2},{1,3},{2,3}}
The a(4) = 80 antichains:
  {1234}  {1}{234}    {1}{2}{34}     {1}{2}{3}{4}       {12}{13}{14}{24}{34}
          {12}{34}    {1}{3}{24}     {1}{23}{24}{34}    {12}{13}{23}{24}{34}
          {13}{24}    {1}{4}{23}     {2}{13}{14}{34}
          {2}{134}    {2}{3}{14}     {12}{13}{14}{24}
          {3}{124}    {1}{23}{24}    {12}{13}{14}{34}
          {4}{123}    {1}{23}{34}    {12}{13}{23}{24}
          {12}{134}   {1}{24}{34}    {12}{13}{23}{34}
          {12}{234}   {2}{13}{14}    {12}{13}{24}{34}
          {13}{124}   {2}{13}{34}    {12}{14}{24}{34}
          {13}{234}   {2}{14}{34}    {12}{23}{24}{34}
          {14}{123}   {3}{14}{24}    {13}{14}{24}{34}
          {14}{234}   {4}{12}{23}    {13}{23}{24}{34}
          {23}{124}   {12}{13}{14}   {12}{13}{14}{234}
          {23}{134}   {12}{13}{24}   {12}{23}{24}{134}
          {24}{134}   {12}{13}{34}   {123}{124}{134}{234}
          {34}{123}   {12}{14}{34}
          {123}{124}  {12}{23}{24}
          {123}{134}  {12}{23}{34}
          {123}{234}  {12}{24}{34}
          {124}{134}  {13}{14}{24}
          {124}{234}  {13}{23}{24}
          {134}{234}  {13}{23}{34}
                      {13}{24}{34}
                      {14}{24}{34}
                      {12}{13}{234}
                      {12}{14}{234}
                      {12}{23}{134}
                      {12}{24}{134}
                      {13}{14}{234}
                      {13}{23}{124}
                      {14}{34}{123}
                      {23}{24}{134}
                      {12}{134}{234}
                      {13}{124}{234}
                      {14}{123}{234}
                      {23}{124}{134}
                      {123}{124}{134}
                      {123}{124}{234}
                      {123}{134}{234}
                      {124}{134}{234}
		

Crossrefs

Antichain covers are A006126.
Set partitions with different block-sums are A275780.
MM-numbers of multiset partitions with different part-sums are A326535.
Antichain covers with equal edge-sums are A326566.
Antichain covers with different edge-sizes are A326570.
The case without singletons is A326571.
Antichains with equal edge-sums are A326574.

Programs

  • Mathematica
    stableSets[u_,Q_]:=If[Length[u]==0,{{}},With[{w=First[u]},Join[stableSets[DeleteCases[u,w],Q],Prepend[#,w]&/@stableSets[DeleteCases[u,r_/;r==w||Q[r,w]||Q[w,r]],Q]]]];
    cleq[n_]:=Select[stableSets[Subsets[Range[n]],SubsetQ[#1,#2]||Total[#1]==Total[#2]&],Union@@#==Range[n]&];
    Table[Length[cleq[n]],{n,0,5}]

A326571 Number of covering antichains of nonempty, non-singleton subsets of {1..n}, all having different sums.

Original entry on oeis.org

1, 0, 1, 5, 61, 2721, 788221
Offset: 0

Views

Author

Gus Wiseman, Jul 18 2019

Keywords

Comments

An antichain is a finite set of finite sets, none of which is a subset of any other. It is covering if its union is {1..n}. The edge-sums are the sums of vertices in each edge, so for example the edge sums of {{1,3},{2,5},{3,4,5}} are {4,7,12}.

Examples

			The a(3) = 5 antichains:
  {{1,2,3}}
  {{1,3},{2,3}}
  {{1,2},{2,3}}
  {{1,2},{1,3}}
  {{1,2},{1,3},{2,3}}
The a(4) = 61 antichains:
  {1234}  {12}{34}    {12}{13}{14}   {12}{13}{14}{24}   {12}{13}{14}{24}{34}
          {13}{24}    {12}{13}{24}   {12}{13}{14}{34}   {12}{13}{23}{24}{34}
          {12}{134}   {12}{13}{34}   {12}{13}{23}{24}
          {12}{234}   {12}{14}{34}   {12}{13}{23}{34}
          {13}{124}   {12}{23}{24}   {12}{13}{24}{34}
          {13}{234}   {12}{23}{34}   {12}{14}{24}{34}
          {14}{123}   {12}{24}{34}   {12}{23}{24}{34}
          {14}{234}   {13}{14}{24}   {13}{14}{24}{34}
          {23}{124}   {13}{23}{24}   {13}{23}{24}{34}
          {23}{134}   {13}{23}{34}   {12}{13}{14}{234}
          {24}{134}   {13}{24}{34}   {12}{23}{24}{134}
          {34}{123}   {14}{24}{34}   {123}{124}{134}{234}
          {123}{124}  {12}{13}{234}
          {123}{134}  {12}{14}{234}
          {123}{234}  {12}{23}{134}
          {124}{134}  {12}{24}{134}
          {124}{234}  {13}{14}{234}
          {134}{234}  {13}{23}{124}
                      {14}{34}{123}
                      {23}{24}{134}
                      {12}{134}{234}
                      {13}{124}{234}
                      {14}{123}{234}
                      {23}{124}{134}
                      {123}{124}{134}
                      {123}{124}{234}
                      {123}{134}{234}
                      {124}{134}{234}
		

Crossrefs

Antichain covers are A006126.
Set partitions with different block-sums are A275780.
MM-numbers of multiset partitions with different part-sums are A326535.
Antichain covers with equal edge-sums and no singletons are A326565.
Antichain covers with different edge-sizes and no singletons are A326569.
The case with singletons allowed is A326572.
Antichains with equal edge-sums are A326574.

Programs

  • Mathematica
    stableSets[u_,Q_]:=If[Length[u]==0,{{}},With[{w=First[u]},Join[stableSets[DeleteCases[u,w],Q],Prepend[#,w]&/@stableSets[DeleteCases[u,r_/;r==w||Q[r,w]||Q[w,r]],Q]]]];
    cleq[n_]:=Select[stableSets[Subsets[Range[n],{2,n}],SubsetQ[#1,#2]||Total[#1]==Total[#2]&],Union@@#==Range[n]&];
    Table[Length[cleq[n]],{n,0,5}]

A326573 Number of connected antichains of subsets of {1..n}, all having different sums.

Original entry on oeis.org

1, 1, 1, 5, 59, 2689, 787382
Offset: 0

Views

Author

Gus Wiseman, Jul 18 2019

Keywords

Comments

An antichain is a finite set of finite sets, none of which is a subset of any other. It is covering if its union is {1..n}. The edge-sums are the sums of vertices in each edge, so for example the edge sums of {{1,3},{2,5},{3,4,5}} are {4,7,12}.

Examples

			The a(3) = 5 antichains:
  {{1,2,3}}
  {{1,3},{2,3}}
  {{1,2},{2,3}}
  {{1,2},{1,3}}
  {{1,2},{1,3},{2,3}}
The a(4) = 59 antichains:
  {1234}  {12}{134}   {12}{13}{14}   {12}{13}{14}{24}   {12}{13}{14}{24}{34}
          {12}{234}   {12}{13}{24}   {12}{13}{14}{34}   {12}{13}{23}{24}{34}
          {13}{124}   {12}{13}{34}   {12}{13}{23}{24}
          {13}{234}   {12}{14}{34}   {12}{13}{23}{34}
          {14}{123}   {12}{23}{24}   {12}{13}{24}{34}
          {14}{234}   {12}{23}{34}   {12}{14}{24}{34}
          {23}{124}   {12}{24}{34}   {12}{23}{24}{34}
          {23}{134}   {13}{14}{24}   {13}{14}{24}{34}
          {24}{134}   {13}{23}{24}   {13}{23}{24}{34}
          {34}{123}   {13}{23}{34}   {12}{13}{14}{234}
          {123}{124}  {13}{24}{34}   {12}{23}{24}{134}
          {123}{134}  {14}{24}{34}   {123}{124}{134}{234}
          {123}{234}  {12}{13}{234}
          {124}{134}  {12}{14}{234}
          {124}{234}  {12}{23}{134}
          {134}{234}  {12}{24}{134}
                      {13}{14}{234}
                      {13}{23}{124}
                      {14}{34}{123}
                      {23}{24}{134}
                      {12}{134}{234}
                      {13}{124}{234}
                      {14}{123}{234}
                      {23}{124}{134}
                      {123}{124}{134}
                      {123}{124}{234}
                      {123}{134}{234}
                      {124}{134}{234}
		

Crossrefs

Antichain covers are A006126.
Connected antichains are A048143.
Set partitions with different block-sums are A275780.
MM-numbers of multiset partitions with different part-sums are A326535.
Antichain covers with equal edge-sums are A326566.
The non-connected case is A326572.

A326569 Number of covering antichains of subsets of {1..n} with no singletons and different edge-sizes.

Original entry on oeis.org

1, 0, 1, 1, 13, 121, 2566, 121199, 13254529
Offset: 0

Views

Author

Gus Wiseman, Jul 18 2019

Keywords

Comments

An antichain is a finite set of finite sets, none of which is a subset of any other. It is covering if its union is {1..n}. The edge-sizes are the numbers of vertices in each edge, so for example the edge sizes of {{1,3},{2,5},{3,4,5}} are {2,2,3}.

Examples

			The a(2) = 1 through a(4) = 13 antichains:
  {{1,2}}  {{1,2,3}}  {{1,2,3,4}}
                      {{1,2},{1,3,4}}
                      {{1,2},{2,3,4}}
                      {{1,3},{1,2,4}}
                      {{1,3},{2,3,4}}
                      {{1,4},{1,2,3}}
                      {{1,4},{2,3,4}}
                      {{2,3},{1,2,4}}
                      {{2,3},{1,3,4}}
                      {{2,4},{1,2,3}}
                      {{2,4},{1,3,4}}
                      {{3,4},{1,2,3}}
                      {{3,4},{1,2,4}}
		

Crossrefs

Antichain covers are A006126.
Set partitions with different block sizes are A007837.
The case with singletons is A326570.

Programs

  • Mathematica
    stableSets[u_,Q_]:=If[Length[u]==0,{{}},With[{w=First[u]},Join[stableSets[DeleteCases[u,w],Q],Prepend[#,w]&/@stableSets[DeleteCases[u,r_/;r==w||Q[r,w]||Q[w,r]],Q]]]];
    cleq[n_]:=Select[stableSets[Subsets[Range[n],{2,n}],SubsetQ[#1,#2]||Length[#1]==Length[#2]&],Union@@#==Range[n]&];
    Table[Length[cleq[n]],{n,0,6}]

Formula

a(n) = A326570(n) - n*a(n-1) for n > 0. - Andrew Howroyd, Aug 13 2019

Extensions

a(8) from Andrew Howroyd, Aug 13 2019
Showing 1-4 of 4 results.