从同构的角度看，有个点的不同构的树，有多少个？ T2 T, 我们有T()=1,1,1,1,2,3,6,11,23,47,106,235,551,1301,3159,… Otter(1948)proved the asymptotic estimate t(n)~Ca"n5/2asn→o, with the values C and a known to be approximately 0.534949606...and 2.95576528565...从同构的角度看，有n个点的不同构的树，有多少个？ 我们有T(n) =