|
%I #22 Jun 21 2018 00:12:15
%S 3,3,8,3,2,1,8,5,6,8,9,9,2,0,7,6,9,5,1,9,6,1,1,2,6,2,5,7,1,7,0,1,7,0,
%T 5,3,1,8,3,7,7,4,6,0,7,5,3,2,9,6,7,7,9,5,5,7,2,3,0,3,7,7,6,2,5,7,6,6,
%U 6,0,5,0,1,8,9,6,2,0,7,6,6,5,6,3,5,2,8,7,9,8,3,6,7,3
%N Decimal expansion of radius of convergence of g.f. for unlabeled trees (A000055).
%H M. Drmota, B. Gittenberger, <a href="https://doi.org/10.1016/j.ejc.2010.05.011">The shape of unlabeled rooted random trees</a>, Eur. J. Comb. 31 (2010) no 8, 2028-2063
%H E. M. Palmer and A. J. Schwenk, <a href="http://dx.doi.org/10.1016/0095-8956(79)90073-X">On the number of trees in a random forest</a>, J. Combin. Theory, B 27 (1979), 109-121.
%F Equals 1/A051491. - _Vaclav Kotesovec_, Jul 29 2013
%e 0.338321856899208...
%t digits = 95; max = 200;
%t s[n_, k_] := s[n, k] = a[n + 1 - k] + If[n < 2*k, 0, s[n - k, k]];
%t a[1] = 1;
%t a[n_] := a[n] = Sum[a[k]*s[n - 1, k]*k, {k, 1, n - 1}]/(n - 1);
%t A[x_] := Sum[a[k]*x^k, {k, 0, max}];
%t eq = Log[c] == 1 + Sum[A[c^-k]/k, {k, 2, max}];
%t r = 1/c /. FindRoot[eq, {c, 3}, WorkingPrecision -> digits + 5];
%t RealDigits[r, 10, digits] // First (* _Jean-François Alcover_, Aug 10 2016 *)
%Y Cf. A000055.
%K nonn,cons
%O 0,1
%A _N. J. A. Sloane_, May 29 2012
%E More terms from _Vaclav Kotesovec_, Jul 29 2013
|
