A318234 Number of inequivalent leaf-colorings of totally transitive rooted trees with n nodes.

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.

Links

Table of n, a(n) for n=1..7.

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

Crossrefs

Cf. A000081, A001190, A001678, A003238, A004111, A290689, A318185, A304486, A318186, A318187.

Cf. A318226, A318227, A318228, A318229, A318230, A318231.

Sequence in context: A154101 A122024 A252932 * A371426 A027931 A218481

Adjacent sequences: A318231 A318232 A318233 * A318235 A318236 A318237

Keyword

nonn,more

Author

Gus Wiseman, Aug 21 2018

Status

approved