|
%I #8 Jun 10 2016 10:07:21
%S 1,5,6,3,5,3,1,7,1,1,0,7,0,5,5,8,5,1,0,7,3,8,8,7,9,0,3,8,6,7,8,0,6,3,
%T 9,2,2,6,9,7,8,3,7,3,2,2,8,8,9,9,4,1,2,7,8,9,2,8,0,0,6,7,9,4,9,3,8,1,
%U 6,5,7,8,0,2,0,9,6,8,8,2,4,4,6,1,3,6,2,4,0,6,2,9,7,8,5,9,9,1,1,5,8,2,7,2
%N Decimal expansion of the base-2 logarithm of Otter's rooted tree constant.
%C 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.)
%H <a href="/index/Tra#trees">Index entries for sequences related to trees</a>
%H <a href="/index/Ro#rooted">Index entries for sequences related to rooted trees</a>
%e 1.5635317110705585107388790386780639226978373228899412789280067949381657802...
%Y Cf. A051491, A000055, A000081.
%K nonn,cons
%O 1,2
%A _Charles R Greathouse IV_, Jun 09 2016
|
