OFFSET
1,5
COMMENTS
A free pure symmetric multifunction (with empty expressions allowed) f in EOME is either (case 1) a positive integer, or (case 2) a possibly empty expression of the form h[g_1, ..., g_k] where k >= 0, h is in EOME, each of the g_i for i = 1, ..., k is in EOME, and for i < j we have g_i <= g_j under a canonical total ordering of EOME, such as the Mathematica ordering of expressions.
T(n,k) is also the number of inequivalent colorings of orderless Mathematica expressions with n positions and k leaves.
LINKS
Andrew Howroyd, Table of n, a(n) for n = 1..325 (rows 1..25)
EXAMPLE
Inequivalent representatives of the T(5,3) = 23 Mathematica expressions:
1[][1,1] 1[1,1][] 1[1][1] 1[1[1]] 1[1,1[]]
1[][1,2] 1[1,2][] 1[1][2] 1[1[2]] 1[1,2[]]
1[][2,2] 1[2,2][] 1[2][1] 1[2[1]] 1[2,1[]]
1[][2,3] 1[2,3][] 1[2][2] 1[2[2]] 1[2,2[]]
1[2][3] 1[2[3]] 1[2,3[]]
Triangle begins:
1
1 0
1 2 0
1 6 4 0
1 12 23 7 0
1 20 81 73 12 0
1 30 209 407 206 19 0
1 42 451 1566 1751 534 30 0
PROG
(PARI) \\ See links in A339645 for combinatorial species functions.
cycleIndexSeries(n)={my(p=O(x)); for(n=1, n, p = x*sv(1) + x*p*sExp(p)); p}
T(n)={my(v=Vec(InequivalentColoringsSeq(sFuncSubst(cycleIndexSeries(n), i->sv(i)*y^i)))); vector(n, n, Vecrev(v[n]/y, n))}
{ my(A=T(10)); for(n=1, #A, print(A[n])) } \\ Andrew Howroyd, Jan 01 2021
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
Gus Wiseman, Aug 17 2018
EXTENSIONS
Terms a(37) and beyond from Andrew Howroyd, Jan 01 2021
STATUS
approved