login

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”).

A318231
Number of inequivalent leaf-colorings of series-reduced rooted trees with n nodes.
12
1, 0, 2, 3, 9, 23, 73, 229, 796, 2891, 11118, 44695, 187825, 820320, 3716501, 17413308, 84209071, 419461933, 2148673503, 11301526295, 60956491070, 336744177291, 1903317319015, 10995856040076, 64873456288903, 390544727861462, 2397255454976268, 14993279955728851
OFFSET
1,3
COMMENTS
In a series-reduced rooted tree, every non-leaf node has at least two branches.
EXAMPLE
Inequivalent representatives of the a(6) = 23 leaf-colorings:
(11(11)) (1(111)) (11111)
(11(12)) (1(112)) (11112)
(11(22)) (1(122)) (11122)
(11(23)) (1(123)) (11123)
(12(11)) (1(222)) (11223)
(12(12)) (1(223)) (11234)
(12(13)) (1(234)) (12345)
(12(33))
(12(34))
PROG
(PARI) \\ 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(concat(v[1..n-2], [0]))), n-1 )); x*Ser(v)}
InequivalentColoringsSeq(cycleIndexSeries(15)) \\ Andrew Howroyd, Dec 11 2020
KEYWORD
nonn
AUTHOR
Gus Wiseman, Aug 21 2018
EXTENSIONS
Terms a(8) and beyond from Andrew Howroyd, Dec 11 2020
STATUS
approved