A281094 Maximum number of nonisomorphic subtrees of a tree of order n.

1, 2, 3, 4, 6, 8, 11, 16, 23, 33, 47, 68, 105, 160, 245, 366, 545, 816, 1212

Offset

1,2

Links

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

É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=5, the path and the star both have five nonisomorphic subtrees (paths resp. stars of all orders from 1 to 5). The third possible tree of order 5 has six nonisomorphic subtrees (one each of order 1,2,3,5 and two of order 4: the star and the path). Hence a(5)=6.

Crossrefs

Cf. A281578.

Sequence in context: A208887 A017911 A057048 * A054782 A261082 A271487

Adjacent sequences: A281091 A281092 A281093 * A281095 A281096 A281097

Keyword

nonn,nice,more

Author

Stephan Wagner, Jan 24 2017

Extensions

a(16)-a(19) from Manfred Scheucher, Mar 10 2018

Status

approved