A330470
Number of non-isomorphic series/singleton-reduced rooted trees on a multiset of size n.
Original entry on oeis.org
1, 1, 2, 7, 39, 236, 1836, 16123, 162008, 1802945, 22012335, 291290460, 4144907830, 62986968311, 1016584428612, 17344929138791, 311618472138440, 5875109147135658, 115894178676866576, 2385755803919949337, 51133201045333895149, 1138659323863266945177, 26296042933904490636133
Offset: 0
Non-isomorphic representatives of the a(4) = 39 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)) ((12)(34))
(1(1(11))) (2(111)) ((11)(22)) (2(113)) (1(2(34)))
((11)(12)) (1(1(22))) (23(11))
(1(1(12))) ((12)(12)) ((11)(23))
(1(2(11))) (1(2(12))) (1(1(23)))
(2(1(11))) ((12)(13))
(1(2(13)))
(2(1(13)))
(2(3(11)))
The case with all atoms equal or all atoms different is
A000669.
Not requiring singleton-reduction gives
A330465.
Labeled versions are
A316651 (normal orderless) and
A330471 (strongly normal).
The case where the leaves are sets is
A330626.
Cf.
A000311,
A005121,
A005804,
A141268,
A213427,
A292504,
A292505,
A318812,
A318848,
A318849,
A330467,
A330469,
A330474,
A330624.
-
\\ See links in A339645 for combinatorial species functions.
cycleIndexSeries(n)={my(v=vector(n)); v[1]=sv(1); for(n=2, #v, v[n] = polcoef( sEulerT(x*Ser(v[1..n])), n )); x*Ser(v)}
InequivalentColoringsSeq(cycleIndexSeries(15)) \\ Andrew Howroyd, Dec 11 2020
A318846
Number of balanced reduced multisystems whose atoms cover an initial interval of positive integers with multiplicities equal to the prime indices of n.
Original entry on oeis.org
1, 1, 1, 1, 2, 3, 6, 4, 15, 11, 20, 21, 90, 51, 80, 32, 468, 166, 2910, 124, 521, 277, 20644, 266, 621, 1761, 1866, 841, 165874, 1374, 1484344, 436, 3797, 12741, 5383, 3108, 14653890, 103783, 31323, 2294, 158136988, 12419, 1852077284, 6382, 20786, 939131, 23394406084
Offset: 1
The a(12) = 21 multisystems on {1,1,2,3} (commas elided):
{1123} {{1}{123}} {{1}{1}{23}} {{{1}}{{1}{23}}}
{{2}{113}} {{1}{2}{13}} {{{23}}{{1}{1}}}
{{3}{112}} {{1}{3}{12}} {{{1}}{{2}{13}}}
{{11}{23}} {{2}{3}{11}} {{{2}}{{1}{13}}}
{{12}{13}} {{{13}}{{1}{2}}}
{{{1}}{{3}{12}}}
{{{3}}{{1}{12}}}
{{{12}}{{1}{3}}}
{{{2}}{{3}{11}}}
{{{3}}{{2}{11}}}
{{{11}}{{2}{3}}}
Cf.
A001055,
A002846,
A005121,
A181821,
A213427,
A281118,
A281119,
A305936,
A318762,
A318812,
A318813.
-
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]]]];
nrmptn[n_]:=Join@@MapIndexed[Table[#2[[1]],{#1}]&,If[n==1,{},Flatten[Cases[FactorInteger[n]//Reverse,{p_,k_}:>Table[PrimePi[p],{k}]]]]];
tmsp[m_]:=Prepend[Join@@Table[tmsp[c],{c,Select[mps[m],1
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
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)))
The case with all atoms different is
A000311.
The case with all atoms equal is
A196545.
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.
-
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[#]
A330664
Number of non-isomorphic balanced reduced multisystems of maximum depth whose degrees (atom multiplicities) are the weakly decreasing prime indices of n.
Original entry on oeis.org
1, 1, 1, 1, 1, 2, 2, 1, 4, 5, 5, 7, 16, 16, 27, 2, 61, 33, 272, 27, 123, 61, 1385, 27, 78, 272, 95, 123, 7936, 362
Offset: 1
Non-isomorphic representatives of the a(n) multisystems for n = 2, 3, 6, 9, 10, 12 (commas and outer brackets elided):
1 11 {1}{12} {{1}}{{1}{22}} {{1}}{{1}{12}} {{1}}{{1}{23}}
{2}{11} {{11}}{{2}{2}} {{11}}{{1}{2}} {{11}}{{2}{3}}
{{1}}{{2}{12}} {{1}}{{2}{11}} {{1}}{{2}{13}}
{{12}}{{1}{2}} {{12}}{{1}{1}} {{12}}{{1}{3}}
{{2}}{{1}{11}} {{2}}{{1}{13}}
{{2}}{{3}{11}}
{{23}}{{1}{1}}
The non-maximal version is
A330666.
The case of constant or strict atoms is
A000111.
Non-isomorphic multiset partitions whose degrees are the prime indices of n are
A318285.
Cf.
A004114,
A005121,
A007716,
A048816,
A141268,
A306186,
A318846,
A318848,
A330470,
A330474,
A330663.
A330728
Number of balanced reduced multisystems of maximum depth whose degrees (atom multiplicities) are the prime indices of n.
Original entry on oeis.org
1, 1, 1, 1, 1, 2, 2, 3, 7, 5, 5, 11, 16, 16, 27, 18, 61, 62, 272, 45, 123, 61, 1385, 105, 152, 272, 501, 211, 7936, 362
Offset: 1
The a(n) multisystems for n = 3, 6, 8, 9, 10, 12 (commas and outer brackets elided):
11 {1}{12} {1}{23} {{1}}{{1}{22}} {{1}}{{1}{12}} {{1}}{{1}{23}}
{2}{11} {2}{13} {{11}}{{2}{2}} {{11}}{{1}{2}} {{11}}{{2}{3}}
{3}{12} {{1}}{{2}{12}} {{1}}{{2}{11}} {{1}}{{2}{13}}
{{12}}{{1}{2}} {{12}}{{1}{1}} {{12}}{{1}{3}}
{{2}}{{1}{12}} {{2}}{{1}{11}} {{1}}{{3}{12}}
{{2}}{{2}{11}} {{13}}{{1}{2}}
{{22}}{{1}{1}} {{2}}{{1}{13}}
{{2}}{{3}{11}}
{{23}}{{1}{1}}
{{3}}{{1}{12}}
{{3}}{{2}{11}}
The version with distinct atoms is
A006472.
The non-maximal version is
A318846.
Final terms in each row of
A330727.
-
nrmptn[n_]:=Join@@MapIndexed[Table[#2[[1]],{#1}]&,If[n==1,{},Flatten[Cases[Reverse[FactorInteger[n]],{p_,k_}:>Table[PrimePi[p],{k}]]]]];
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
A330727
Irregular triangle read by rows where T(n,k) is the number of balanced reduced multisystems of depth k whose degrees (atom multiplicities) are the prime indices of n.
Original entry on oeis.org
1, 1, 1, 1, 2, 1, 3, 2, 1, 3, 1, 7, 7, 1, 5, 5, 1, 5, 9, 5, 1, 9, 11, 1, 9, 28, 36, 16, 1, 10, 24, 16, 1, 14, 38, 27, 1, 13, 18, 1, 13, 69, 160, 164, 61, 1, 24, 79, 62, 1, 20, 160, 580, 1022, 855, 272, 1, 19, 59, 45, 1, 27, 138, 232, 123, 1, 17, 77, 121, 61
Offset: 2
Triangle begins:
{}
1
1
1 1
1 2
1 3 2
1 3
1 7 7
1 5 5
1 5 9 5
1 9 11
1 9 28 36 16
1 10 24 16
1 14 38 27
1 13 18
1 13 69 160 164 61
1 24 79 62
For example, row n = 12 counts the following multisystems:
{1,1,2,3} {{1},{1,2,3}} {{{1}},{{1},{2,3}}}
{{1,1},{2,3}} {{{1,1}},{{2},{3}}}
{{1,2},{1,3}} {{{1}},{{2},{1,3}}}
{{2},{1,1,3}} {{{1,2}},{{1},{3}}}
{{3},{1,1,2}} {{{1}},{{3},{1,2}}}
{{1},{1},{2,3}} {{{1,3}},{{1},{2}}}
{{1},{2},{1,3}} {{{2}},{{1},{1,3}}}
{{1},{3},{1,2}} {{{2}},{{3},{1,1}}}
{{2},{3},{1,1}} {{{2,3}},{{1},{1}}}
{{{3}},{{1},{1,2}}}
{{{3}},{{2},{1,1}}}
Final terms in each row are
A330728.
Column k = 3 is
A318284(n) - 2 for n > 2.
Cf.
A000111,
A002846,
A005121,
A292504,
A318812,
A318813,
A318847,
A318848,
A318849,
A330475,
A330666,
A330935.
-
nrmptn[n_]:=Join@@MapIndexed[Table[#2[[1]],{#1}]&,If[n==1,{},Flatten[Cases[Reverse[FactorInteger[n]],{p_,k_}:>Table[PrimePi[p],{k}]]]]];
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
A318847
Number of tree-partitions of a multiset whose multiplicities are the prime indices of n.
Original entry on oeis.org
1, 1, 2, 2, 4, 6, 12, 8, 28, 20, 32, 38, 112, 76, 116, 58, 352, 236, 1296, 176, 540, 288, 4448, 374, 612, 1144, 1812, 824, 16640, 1316, 59968, 612, 2336, 4528, 3208, 2924, 231168, 18320, 10632, 2168, 856960, 7132, 3334400, 3776, 11684, 74080, 12679424, 4919, 19192
Offset: 1
The a(6) = 6 tree-partitions of {1,1,2}:
(112)
((1)(12))
((2)(11))
((1)(1)(2))
((1)((1)(2)))
((2)((1)(1)))
Cf.
A000311,
A001055,
A196545,
A281118,
A281119,
A305936,
A318762,
A318812,
A318813,
A318846,
A318848.
-
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]]]];
nrmptn[n_]:=Join@@MapIndexed[Table[#2[[1]],{#1}]&,If[n==1,{},Flatten[Cases[FactorInteger[n]//Reverse,{p_,k_}:>Table[PrimePi[p],{k}]]]]];
allmsptrees[m_]:=Prepend[Join@@Table[Tuples[allmsptrees/@p],{p,Select[mps[m],Length[#]>1&]}],m];
Table[Length[allmsptrees[nrmptn[n]]],{n,20}]
Showing 1-7 of 7 results.
Comments