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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A281578 Maximum number of nonisomorphic root-containing subtrees of a rooted tree of order n 2
 1, 2, 3, 5, 7, 11, 16, 24, 34, 54, 79, 119, 169, 269, 394, 594, 850 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Isomorphism is understood in the rooted sense: isomorphisms have to preserve the root. LINKS Éva Czabarka, László A. Székely and Stephan Wagner, On the number of nonisomorphic subtrees of a tree, arXiv:1601.00944 [math.CO], 2016. Manfred Scheucher, Sage Script (dynamic programming) EXAMPLE For n=4, the unique rooted tree with two branches of order 1 and 2 respectively has a(4)=5 nonisomorphic subtrees containing the root: one each of order 1,2,4, and two of order 3. The three other rooted trees of order 4 have only four nonisomorphic subtrees. CROSSREFS Cf. A281094. Sequence in context: A326467 A326592 A226541 * A173199 A023435 A274184 Adjacent sequences:  A281575 A281576 A281577 * A281579 A281580 A281581 KEYWORD nonn,more AUTHOR Stephan Wagner, Jan 24 2017 EXTENSIONS a(16)-a(17) from Manfred Scheucher, Mar 11 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.

Last modified March 29 15:16 EDT 2020. Contains 333107 sequences. (Running on oeis4.)