login
A318234
Number of inequivalent leaf-colorings of totally transitive rooted trees with n nodes.
6
1, 1, 2, 5, 13, 34, 87
OFFSET
1,3
COMMENTS
A rooted tree is totally transitive if every branch of the root is totally transitive and every branch of a branch of the root is also a branch of the root.
EXAMPLE
Inequivalent representatives of the a(6) = 34 leaf-colorings:
(11(11)) (11111) (111(1)) (1(111)) (1(1)(1))
(11(12)) (11112) (111(2)) (1(112)) (1(1)(2))
(11(22)) (11122) (112(1)) (1(122)) (1(2)(2))
(11(23)) (11123) (112(2)) (1(123)) (1(2)(3))
(12(11)) (11223) (112(3)) (1(222))
(12(12)) (11234) (123(1)) (1(223))
(12(13)) (12345) (123(4)) (1(234))
(12(33))
(12(34))
KEYWORD
nonn,more
AUTHOR
Gus Wiseman, Aug 21 2018
STATUS
approved