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.

A320330 Number of T_0 multiset partitions of integer partitions of n.

Original entry on oeis.org

1, 1, 3, 5, 13, 25, 50, 100, 195, 366, 707, 1333, 2440
Offset: 0

Views

Author

Gus Wiseman, Oct 11 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 T_0 condition means the dual is strict.

Examples

			The a(1) = 1 through a(5) = 25 multiset partitions:
  {{1}}  {{2}}      {{3}}          {{4}}              {{5}}
         {{1,1}}    {{1,1,1}}      {{2,2}}            {{1,1,3}}
         {{1},{1}}  {{1},{2}}      {{1,1,2}}          {{1,2,2}}
                    {{1},{1,1}}    {{1},{3}}          {{1},{4}}
                    {{1},{1},{1}}  {{2},{2}}          {{2},{3}}
                                   {{1,1,1,1}}        {{1,1,1,2}}
                                   {{1},{1,2}}        {{1},{1,3}}
                                   {{2},{1,1}}        {{1},{2,2}}
                                   {{1},{1,1,1}}      {{2},{1,2}}
                                   {{1,1},{1,1}}      {{3},{1,1}}
                                   {{1},{1},{2}}      {{1,1,1,1,1}}
                                   {{1},{1},{1,1}}    {{1},{1,1,2}}
                                   {{1},{1},{1},{1}}  {{1,1},{1,2}}
                                                      {{1},{1},{3}}
                                                      {{1},{2},{2}}
                                                      {{2},{1,1,1}}
                                                      {{1},{1,1,1,1}}
                                                      {{1,1},{1,1,1}}
                                                      {{1},{1},{1,2}}
                                                      {{1},{2},{1,1}}
                                                      {{1},{1},{1,1,1}}
                                                      {{1},{1,1},{1,1}}
                                                      {{1},{1},{1},{2}}
                                                      {{1},{1},{1},{1,1}}
                                                      {{1},{1},{1},{1},{1}}
		

Crossrefs

Programs

  • Mathematica
    sps[{}]:={{}};sps[set:{i_,_}]:=Join@@Function[s,Prepend[#,s]&/@sps[Complement[set,s]]]/@Cases[Subsets[set],{i,_}];
    mps[set_]:=Union[Sort[Sort/@(#/.x_Integer:>set[[x]])]&/@sps[Range[Length[set]]]];
    dual[eds_]:=Table[First/@Position[eds,x],{x,Union@@eds}];
    Table[Length[Select[Join@@mps/@IntegerPartitions[n],UnsameQ@@dual[#]&]],{n,8}]