1,2

Storing an arbitrary unlabeled tree with n nodes takes an information-theoretic minimum of kn + O(log n) bits, where k = 1.56... is this constant. (This holds for either rooted or unrooted trees.)

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

Index entries for sequences related to trees

Index entries for sequences related to rooted trees

1.5635317110705585107388790386780639226978373228899412789280067949381657802...

Cf. A051491, A000055, A000081.

Sequence in context: A114598 A272489 A259500 * A199666 A307619 A123852

Adjacent sequences: A274079 A274080 A274081 * A274083 A274084 A274085

nonn,cons

Charles R Greathouse IV, Jun 09 2016

approved