proposed
approved
Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
proposed
approved
editing
proposed
1, 3, 26, 375, 6696, 159837, 4389226, 144915350, 5377002075, 227624621051, 10632808475596, 550932945236121, 31062550998284221, 1907051034025848314, 126052420069459211076, 8956882232940915920404, 679298518935625486287703, 54868537321267493152151502, 4696952405203792017289469056
(PARI) \\ See links in A339645 for combinatorial species functions.
cycleIndexSeries(n)={my(p=O(x)); for(n=1, n, p = x*sv(1) + p*(sExp(p)-1)); p}
StronglyNormalLabelingsSeq(cycleIndexSeries(15)) \\ Andrew Howroyd, Jan 01 2021
nonn,more
nonn
Terms a(8) and beyond from Andrew Howroyd, Jan 01 2021
approved
editing
proposed
approved
editing
proposed
A multiset is strongly normal if it spans an initial interval of positive integers with weakly decreasing multiplicities. A free pure symmetric multifunction f in PSM EPSM is either (case 1) a positive integer, or (case 2) an expression of the form h[g_1, ..., g_k] where k > 0, h is in PSM, EPSM, each of the g_i for i = 1, ..., k is in PSM, EPSM, and for i < j we have g_i <= g_j under a canonical total ordering of PSM, EPSM, such as the Mathematica ordering of expressions.
The a(3) = 26 expressionsfree pure symmetric multifunctions:
allocated for Gus WisemanNumber of free pure symmetric multifunctions whose leaves are a strongly normal multiset of size n.
1, 3, 26, 375, 6696, 159837, 4389226
1,2
A multiset is strongly normal if it spans an initial interval of positive integers with weakly decreasing multiplicities. A free pure symmetric multifunction f in PSM is either (case 1) a positive integer, or (case 2) an expression of the form h[g_1, ..., g_k] where k > 0, h is in PSM, each of the g_i for i = 1, ..., k is in PSM, and for i < j we have g_i <= g_j under a canonical total ordering of PSM, such as the Mathematica ordering of expressions.
The a(3) = 26 expressions:
1[1[1]], 1[1,1], 1[1][1],
1[1[2]], 1[2[1]], 1[1,2], 2[1[1]], 2[1,1], 1[1][2], 1[2][1], 2[1][1],
1[2[3]], 1[3[2]], 1[2,3], 2[1[3]], 2[3[1]], 2[1,3], 3[1[2]], 3[2[1]], 3[1,2], 1[2][3], 2[1][3], 1[3][2], 3[1][2], 2[3][1], 3[2][1].
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]]]];
exprUsing[m_]:=exprUsing[m]=If[Length[m]==0, {}, If[Length[m]==1, {First[m]}, Join@@Cases[Union[Table[PR[m[[s]], m[[Complement[Range[Length[m]], s]]]], {s, Take[Subsets[Range[Length[m]]], {2, -2}]}]], PR[h_, g_]:>Join@@Table[Apply@@@Tuples[{exprUsing[h], Union[Sort/@Tuples[exprUsing/@p]]}], {p, mps[g]}]]]];
got[y_]:=Join@@Table[Table[i, {y[[i]]}], {i, Range[Length[y]]}];
Table[Sum[Length[exprUsing[got[y]]], {y, IntegerPartitions[n]}], {n, 6}]
allocated
nonn,more
Gus Wiseman, Aug 03 2018
approved
editing
allocated for Gus Wiseman
allocated
approved