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.

Previous Showing 41-44 of 44 results.

A319623 Number of connected antichain covers of n vertices by distinct sets whose dual is also an antichain of distinct sets.

Original entry on oeis.org

1, 1, 0, 1, 15, 1957
Offset: 0

Views

Author

Gus Wiseman, Sep 25 2018

Keywords

Comments

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}}.

Examples

			Non-isomorphic representatives of the a(1) = 1 through a(4) = 15 antichain covers:
1: {{1}}
3: {{1,2},{1,3},{2,3}}
4: {{1,2},{1,3},{2,4},{3,4}}
   {{1,3},{1,4},{2,3},{2,4}}
   {{1,2},{1,4},{2,3},{3,4}}
   {{1,4},{2,4},{3,4},{1,2,3}}
   {{1,3},{2,3},{3,4},{1,2,4}}
   {{1,2},{2,3},{2,4},{1,3,4}}
   {{1,2},{1,3},{1,4},{2,3,4}}
   {{1,3},{1,4},{2,3},{2,4},{3,4}}
   {{1,2},{1,4},{2,3},{2,4},{3,4}}
   {{1,2},{1,3},{2,3},{2,4},{3,4}}
   {{1,2},{1,3},{1,4},{2,4},{3,4}}
   {{1,2},{1,3},{1,4},{2,3},{3,4}}
   {{1,2},{1,3},{1,4},{2,3},{2,4}}
   {{1,2,3},{1,2,4},{1,3,4},{2,3,4}}
   {{1,2},{1,3},{1,4},{2,3},{2,4},{3,4}}
		

Crossrefs

A319624 Number of non-isomorphic connected antichain covers of n vertices by distinct sets whose dual is also an antichain of distinct sets.

Original entry on oeis.org

1, 1, 0, 1, 5, 63
Offset: 0

Views

Author

Gus Wiseman, Sep 25 2018

Keywords

Comments

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}}.

Examples

			Non-isomorphic representatives of the a(1) = 1 through a(4) = 5 antichain covers:
1: {{1}}
3: {{1,2},{1,3},{2,3}}
4: {{1,2},{1,3},{2,4},{3,4}}
   {{1,2},{1,3},{1,4},{2,3,4}}
   {{1,3},{1,4},{2,3},{2,4},{3,4}}
   {{1,2,3},{1,2,4},{1,3,4},{2,3,4}}
   {{1,2},{1,3},{1,4},{2,3},{2,4},{3,4}}
		

Crossrefs

A321484 Number of non-isomorphic self-dual connected multiset partitions of weight n.

Original entry on oeis.org

1, 1, 1, 2, 3, 6, 9, 20, 35, 78, 141
Offset: 0

Views

Author

Gus Wiseman, Nov 16 2018

Keywords

Comments

The dual of a multiset partition has, for each vertex, one part consisting of the indices (or positions) of the parts 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.

Examples

			Non-isomorphic representatives of the a(1) = 1 through a(6) = 9 multiset partitions:
  {{1}}  {{11}}  {{111}}    {{1111}}    {{11111}}      {{111111}}
                 {{2}{12}}  {{12}{12}}  {{11}{122}}    {{112}{122}}
                            {{2}{122}}  {{12}{122}}    {{12}{1222}}
                                        {{2}{1222}}    {{2}{12222}}
                                        {{2}{13}{23}}  {{22}{1122}}
                                        {{3}{3}{123}}  {{12}{13}{23}}
                                                       {{2}{13}{233}}
                                                       {{3}{23}{123}}
                                                       {{3}{3}{1233}}
		

Crossrefs

A322076 Number of set multipartitions (multisets of sets) with no singletons, of a multiset whose multiplicities are the prime indices of n.

Original entry on oeis.org

1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 4, 0, 1, 0, 0, 0, 0, 0, 3, 1, 0, 2, 0, 0, 1, 0, 11, 0, 0, 0, 5, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 13, 1, 1, 0, 0, 0, 7, 0, 0, 0, 0, 0, 3, 0, 0, 1, 41, 0, 0, 0, 0, 0, 1, 0, 20, 0, 0, 2, 0, 0, 0, 0, 6, 16, 0, 0, 1, 0
Offset: 1

Views

Author

Gus Wiseman, Nov 25 2018

Keywords

Comments

This multiset (row n of A305936) is generally not the same as the multiset of prime indices of n. For example, the prime indices of 12 are {1,1,2}, while a multiset whose multiplicities are {1,1,2} is {1,1,2,3}.

Examples

			The a(90) = 7 set multipartitions of {1,1,1,2,2,3,3,4} with no singletons:
  {{1,2},{1,2},{1,3},{3,4}}
  {{1,2},{1,3},{1,3},{2,4}}
  {{1,2},{1,3},{1,4},{2,3}}
  {{1,2},{1,3},{1,2,3,4}}
  {{1,2},{1,2,3},{1,3,4}}
  {{1,3},{1,2,3},{1,2,4}}
  {{1,4},{1,2,3},{1,2,3}}
		

Crossrefs

Programs

  • Mathematica
    nrmptn[n_]:=Join@@MapIndexed[Table[#2[[1]],{#1}]&,If[n==1,{},Flatten[Cases[FactorInteger[n]//Reverse,{p_,k_}:>Table[PrimePi[p],{k}]]]]];
    sqnopfacs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[sqnopfacs[n/d],Min@@#>=d&]],{d,Select[Rest[Divisors[n]],!PrimeQ[#]&&SquareFreeQ[#]&]}]];
    Table[Length[sqnopfacs[Times@@Prime/@nrmptn[n]]],{n,30}]
Previous Showing 41-44 of 44 results.