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

Author

Stephan Wagner, Jan 24 2017

Keywords

• nonn
• nice
• more

Examples

			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.
		

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)

Crossrefs

Cf. A281578.

Extensions

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