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

A330475 Number of balanced reduced multisystems whose atoms constitute a strongly normal multiset of size n.

Original entry on oeis.org

1, 1, 2, 9, 85, 1143, 25270
Offset: 0

Views

Author

Gus Wiseman, Dec 27 2019

Keywords

Comments

A balanced reduced multisystem is either a finite multiset, or a multiset partition with at least two parts, not all of which are singletons, of a balanced reduced multisystem.
A finite multiset is strongly normal if it covers an initial interval of positive integers with weakly decreasing multiplicities.

Examples

			The a(0) = 1 through a(3) = 9 multisystems:
  {}  {1}  {1,1}  {1,1,1}
           {1,2}  {1,1,2}
                  {1,2,3}
                  {{1},{1,1}}
                  {{1},{1,2}}
                  {{1},{2,3}}
                  {{2},{1,1}}
                  {{2},{1,3}}
                  {{3},{1,2}}

Crossrefs

The (weakly) normal version is A330655.
The maximum-depth case is A330675.
The case where the atoms are {1..n} is A005121.
The case where the atoms are all 1's is A318813.
The tree version is A330471.
Multiset partitions of strongly normal multisets are A035310.
Cf. A000311, A000669, A001678, A316652, A318812, A330467, A330474, A330628, A330663, A330679.

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]]]];
strnorm[n_]:=Flatten[MapIndexed[Table[#2,{#1}]&,#]]&/@IntegerPartitions[n];
totm[m_]:=Prepend[Join@@Table[totm[p],{p,Select[mps[m],1

A330675 Number of balanced reduced multisystems of maximum depth whose atoms constitute a strongly normal multiset of size n.

Original entry on oeis.org

1, 1, 2, 6, 43, 440, 7158, 151414
Offset: 0

Views

Author

Gus Wiseman, Dec 30 2019

Keywords

Comments

A balanced reduced multisystem is either a finite multiset, or a multiset partition with at least two parts, not all of which are singletons, of a balanced reduced multisystem.
A finite multiset is strongly normal if it covers an initial interval of positive integers with weakly decreasing multiplicities.

Examples

			The a(2) = 2 and a(3) = 6 multisystems:
  {1,1}  {{1},{1,1}}
  {1,2}  {{1},{1,2}}
         {{1},{2,3}}
         {{2},{1,1}}
         {{2},{1,3}}
         {{3},{1,2}}
The a(4) = 43 multisystems (commas and outer brackets elided):
  {{1}}{{1}{11}} {{1}}{{1}{12}} {{1}}{{1}{22}} {{1}}{{1}{23}} {{1}}{{2}{34}}
  {{11}}{{1}{1}} {{11}}{{1}{2}} {{11}}{{2}{2}} {{11}}{{2}{3}} {{12}}{{3}{4}}
                 {{1}}{{2}{11}} {{1}}{{2}{12}} {{1}}{{2}{13}} {{1}}{{3}{24}}
                 {{12}}{{1}{1}} {{12}}{{1}{2}} {{12}}{{1}{3}} {{13}}{{2}{4}}
                 {{2}}{{1}{11}} {{2}}{{1}{12}} {{1}}{{3}{12}} {{1}}{{4}{23}}
                                {{2}}{{2}{11}} {{13}}{{1}{2}} {{14}}{{2}{3}}
                                {{22}}{{1}{1}} {{2}}{{1}{13}} {{2}}{{1}{34}}
                                               {{2}}{{3}{11}} {{2}}{{3}{14}}
                                               {{23}}{{1}{1}} {{23}}{{1}{4}}
                                               {{3}}{{1}{12}} {{2}}{{4}{13}}
                                               {{3}}{{2}{11}} {{24}}{{1}{3}}
                                                              {{3}}{{1}{24}}
                                                              {{3}}{{2}{14}}
                                                              {{3}}{{4}{12}}
                                                              {{34}}{{1}{2}}
                                                              {{4}}{{1}{23}}
                                                              {{4}}{{2}{13}}
                                                              {{4}}{{3}{12}}

Crossrefs

The case with all atoms equal is A000111.
The case with all atoms different is A006472.
The version allowing all depths is A330475.
The unlabeled version is A330663.
The version where the atoms are the prime indices of n is A330665.
The (weakly) normal version is A330676.
The version where the degrees are the prime indices of n is A330728.
Multiset partitions of strongly normal multisets are A035310.
Series-reduced rooted trees with strongly normal leaves are A316652.
Cf. A000311, A000669, A001055, A001678, A005121, A005804, A316651, A318812, A330467, A330474, A330625, A330628, A330664, A330677, A330679.

Programs

  • Mathematica
    strnorm[n_]:=Flatten[MapIndexed[Table[#2,{#1}]&,#]]&/@IntegerPartitions[n];
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]]]];
totm[m_]:=Prepend[Join@@Table[totm[p],{p,Select[mps[m],1

A330624 Number of non-isomorphic series-reduced rooted trees whose leaves are sets (not necessarily disjoint) with a total of n elements.

Original entry on oeis.org

1, 1, 3, 10, 61, 410, 3630
Offset: 0

Views

Author

Gus Wiseman, Dec 25 2019

Keywords

Comments

A rooted tree is series-reduced if it has no unary branchings, so every non-leaf node covers at least two other nodes.

Examples

			Non-isomorphic representatives of the a(1) = 1 through a(3) = 10 trees:
  {1}  {1,2}      {1,2,3}
       {{1},{1}}  {{1},{1,2}}
       {{1},{2}}  {{1},{2,3}}
                  {{1},{1},{1}}
                  {{1},{1},{2}}
                  {{1},{2},{3}}
                  {{1},{{1},{1}}}
                  {{1},{{1},{2}}}
                  {{1},{{2},{3}}}
                  {{2},{{1},{1}}}

Crossrefs

The version with multisets as leaves is A330465.
The singleton-reduced case is A330626.
A labeled version is A330625 (strongly normal).
The case with all atoms distinct is A141268.
The case where all leaves are singletons is A330470.
Cf. A000669, A004111, A005804, A007716, A273873, A300660, A320296, A330628, A330668, A330677.

A330471 Number of series/singleton-reduced rooted trees on strongly normal multisets of size n.

Original entry on oeis.org

1, 1, 2, 9, 69, 623, 7803, 110476, 1907428
Offset: 0

Views

Author

Gus Wiseman, Dec 23 2019

Keywords

Comments

A multiset is strongly normal if it covers an initial interval of positive integers with weakly decreasing multiplicities.
A series/singleton-reduced rooted tree on a multiset m is either the multiset m itself or a sequence of series/singleton-reduced rooted trees, one on each part of a multiset partition of m that is neither minimal (all singletons) nor maximal (only one part). This is a multiset generalization of singleton-reduced phylogenetic trees (A000311).

Examples

			The a(0) = 1 through a(3) = 9 trees:
  ()  (1)  (11)  (111)
           (12)  (112)
                 (123)
                 ((1)(11))
                 ((1)(12))
                 ((1)(23))
                 ((2)(11))
                 ((2)(13))
                 ((3)(12))
The a(4) = 69 trees, with singleton leaves (x) replaced by just x:
  (1111)      (1112)      (1122)      (1123)      (1234)
  (1(111))    (1(112))    (1(122))    (1(123))    (1(234))
  (11(11))    (11(12))    (11(22))    (11(23))    (12(34))
  ((11)(11))  (12(11))    (12(12))    (12(13))    (13(24))
  (1(1(11)))  (2(111))    (2(112))    (13(12))    (14(23))
              ((11)(12))  (22(11))    (2(113))    (2(134))
              (1(1(12)))  ((11)(22))  (23(11))    (23(14))
              (1(2(11)))  (1(1(22)))  (3(112))    (24(13))
              (2(1(11)))  ((12)(12))  ((11)(23))  (3(124))
                          (1(2(12)))  (1(1(23)))  (34(12))
                          (2(1(12)))  ((12)(13))  (4(123))
                          (2(2(11)))  (1(2(13)))  ((12)(34))
                                      (1(3(12)))  (1(2(34)))
                                      (2(1(13)))  ((13)(24))
                                      (2(3(11)))  (1(3(24)))
                                      (3(1(12)))  ((14)(23))
                                      (3(2(11)))  (1(4(23)))
                                                  (2(1(34)))
                                                  (2(3(14)))
                                                  (2(4(13)))
                                                  (3(1(24)))
                                                  (3(2(14)))
                                                  (3(4(12)))
                                                  (4(1(23)))
                                                  (4(2(13)))
                                                  (4(3(12)))

Crossrefs

The case with all atoms different is A000311.
The case with all atoms equal is A196545.
The orderless version is A316652.
The unlabeled version is A330470.
The case where the leaves are sets is A330628.
The version for just normal (not strongly normal) is A330654.
Cf. A000669, A004114, A005121, A005804, A281118, A318812, A318848, A319312, A330465, A330467, A330475.

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]]]];
strnorm[n_]:=Flatten[MapIndexed[Table[#2,{#1}]&,#]]&/@IntegerPartitions[n];
mtot[m_]:=Prepend[Join@@Table[Tuples[mtot/@p],{p,Select[mps[m],Length[#]>1&&Length[#]

A330625 Number of series-reduced rooted trees whose leaves are sets (not necessarily disjoint) with multiset union a strongly normal multiset of size n.

Original entry on oeis.org

1, 1, 3, 14, 123, 1330, 19694
Offset: 0

Views

Author

Gus Wiseman, Dec 25 2019

Keywords

Comments

A rooted tree is series-reduced if it has no unary branchings, so every non-leaf node covers at least two other nodes.
A finite multiset is strongly normal if it covers an initial interval of positive integers with weakly decreasing multiplicities.

Examples

			The a(1) = 1 through a(3) = 14 trees:
  {1}  {1,2}      {1,2,3}
       {{1},{1}}  {{1},{1,2}}
       {{1},{2}}  {{1},{2,3}}
                  {{2},{1,3}}
                  {{3},{1,2}}
                  {{1},{1},{1}}
                  {{1},{1},{2}}
                  {{1},{2},{3}}
                  {{1},{{1},{1}}}
                  {{1},{{1},{2}}}
                  {{1},{{2},{3}}}
                  {{2},{{1},{1}}}
                  {{2},{{1},{3}}}
                  {{3},{{1},{2}}}

Crossrefs

The generalization where the leaves are multisets is A330467.
The singleton-reduced case is A330628.
The unlabeled version is A330624.
The case with all atoms distinct is A005804.
The case with all atoms equal is A196545.
The case where all leaves are singletons is A330471.
Cf. A000669, A004111, A141268, A300660, A316652, A330469, A330475, A330626, A330668, A330675.

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]]]];
strnorm[n_]:=Flatten[MapIndexed[Table[#2,{#1}]&,#]]&/@IntegerPartitions[n];
srtrees[m_]:=Prepend[Join@@Table[Tuples[srtrees/@p],{p,Select[mps[m],Length[#1]>1&]}],m];
Table[Sum[Length[Select[srtrees[s],FreeQ[#,{_,x_Integer,x_Integer,_}]&]],{s,strnorm[n]}],{n,0,5}]

A330626 Number of non-isomorphic series/singleton-reduced rooted trees whose leaves are sets (not necessarily disjoint) with a total of n atoms.

Original entry on oeis.org

1, 1, 1, 3, 17, 100, 755
Offset: 0

Views

Author

Gus Wiseman, Dec 26 2019

Keywords

Comments

A series/singleton-reduced rooted tree on a multiset m is either the multiset m itself or a sequence of series/singleton-reduced rooted trees, one on each part of a multiset partition of m that is neither minimal (all singletons) nor maximal (only one part).

Examples

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

Crossrefs

The non-singleton-reduced version is A330624.
The generalization where leaves are multisets is A330470.
A labeled version is A330628 (strongly normal).
The case with all atoms distinct is A004114.
The balanced version is A330668.
Cf. A000669, A004111, A005804, A007716, A141268, A330465, A330625, A330627, A330654, A330663, A330677.

A330783 Number of set multipartitions (multisets of sets) of strongly normal multisets of size n, where a finite multiset is strongly normal if it covers an initial interval of positive integers with weakly decreasing multiplicities.

Original entry on oeis.org

1, 1, 3, 8, 27, 94, 385, 1673, 8079, 41614, 231447, 1364697, 8559575, 56544465, 393485452, 2867908008, 21869757215, 173848026202, 1438593095272, 12360614782433, 110119783919367, 1015289796603359, 9674959683612989, 95147388659652754, 964559157655032720, 10067421615492769230
Offset: 0

Views

Author

Gus Wiseman, Jan 02 2020

Keywords

Comments

The (weakly) normal version is A116540.

Examples

			The a(1) = 1 through a(3) = 8 set multipartitions:
  {{1}}  {{1,2}}    {{1,2,3}}
         {{1},{1}}  {{1},{1,2}}
         {{1},{2}}  {{1},{2,3}}
                    {{2},{1,3}}
                    {{3},{1,2}}
                    {{1},{1},{1}}
                    {{1},{1},{2}}
                    {{1},{2},{3}}
The a(4) = 27 set multipartitions:
  {{1},{1},{1},{1}}  {{1},{1},{1,2}}  {{1},{1,2,3}}  {{1,2,3,4}}
  {{1},{1},{1},{2}}  {{1},{1},{2,3}}  {{1,2},{1,2}}
  {{1},{1},{2},{2}}  {{1},{2},{1,2}}  {{1,2},{1,3}}
  {{1},{1},{2},{3}}  {{1},{2},{1,3}}  {{1},{2,3,4}}
  {{1},{2},{3},{4}}  {{1},{2},{3,4}}  {{1,2},{3,4}}
                     {{1},{3},{1,2}}  {{1,3},{2,4}}
                     {{1},{3},{2,4}}  {{1,4},{2,3}}
                     {{1},{4},{2,3}}  {{2},{1,3,4}}
                     {{2},{3},{1,4}}  {{3},{1,2,4}}
                     {{2},{4},{1,3}}  {{4},{1,2,3}}
                     {{3},{4},{1,2}}

Links

Crossrefs

Allowing edges to be multisets gives is A035310.
The strict case is A318402.
The constant case is A000005.
The (weakly) normal version is A116540.
Unlabeled set multipartitions are A049311.
Set multipartitions of prime indices are A050320.
Set multipartitions of integer partitions are A089259.
Cf. A001055, A047968, A255906, A269134, A283877, A296119, A317775, A318360, A318362, A330625, A330628.

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]]]];
strnorm[n_]:=Flatten[MapIndexed[Table[#2,{#1}]&,#]]&/@IntegerPartitions[n];
Table[Length[Select[Join@@mps/@strnorm[n],And@@UnsameQ@@@#&]],{n,0,5}]
  • PARI
    WeighT(v)={Vec(exp(x*Ser(dirmul(v, vector(#v,n,(-1)^(n-1)/n))))-1,-#v)}
D(p, n)={my(v=vector(n)); for(i=1, #p, v[p[i]]++); my(u=WeighT(v)); Vec(1/prod(k=1, n, 1 - u[k]*x^k + O(x*x^n)))/prod(i=1, #v, i^v[i]*v[i]!)}
seq(n)={my(s=0); forpart(p=n, s+=D(p,n)); s} \\ Andrew Howroyd, Dec 30 2020

Extensions

Terms a(10) and beyond from Andrew Howroyd, Dec 30 2020

A330668 Number of non-isomorphic balanced reduced multisystems of weight n whose leaves (which are multisets of atoms) are all sets.

Original entry on oeis.org

1, 1, 1, 3, 22, 204, 2953
Offset: 0

Views

Author

Gus Wiseman, Dec 27 2019

Keywords

Comments

A balanced reduced multisystem is either a finite multiset, or a multiset partition with at least two parts, not all of which are singletons, of a balanced reduced multisystem. The weight of an atom is 1, while the weight of a multiset is the sum of weights of its elements.

Examples

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

Crossrefs

The case with all atoms different is A318813.
The version where the leaves are multisets is A330474.
The tree version is A330626.
The maximum-depth case is A330677.
Unlabeled series-reduced rooted trees whose leaves are sets are A330624.
Cf. A000311, A004114, A005121, A005804, A007716, A048816, A141268, A283877, A306186, A318812, A320154, A330470, A330628, A330663.
Showing 1-8 of 8 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.