login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A318231 Number of inequivalent leaf-colorings of series-reduced rooted trees with n nodes. 10
1, 0, 2, 3, 9, 23, 73 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

In a series-reduced rooted tree, every non-leaf node has at least two branches.

LINKS

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

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

CROSSREFS

Cf. A000081, A001190, A001678, A003238, A004111, A290689, A291636, A304486.

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

Sequence in context: A227252 A274495 A299705 * A242271 A056198 A143742

Adjacent sequences:  A318228 A318229 A318230 * A318232 A318233 A318234

KEYWORD

nonn,more

AUTHOR

Gus Wiseman, Aug 21 2018

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 18 15:04 EST 2020. Contains 332019 sequences. (Running on oeis4.)