|
%I M1142 #30 Oct 21 2023 19:59:30
%S 1,1,1,1,2,4,8,17,37,85,196,469,1134,2799,6975,17628,44903,115497,
%T 299089,780036,2045924,5396078,14299878,38067356,101748748,272995157,
%U 735004112,1985356350,5378958683,14614641597,39813346977,108730631236,297641593852
%N Number of stable trees with n nodes.
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H Alois P. Heinz, <a href="/A003426/b003426.txt">Table of n, a(n) for n = 1..1000</a> (first 100 terms from Sean A. Irvine)
%H D. D. Grant, <a href="http://dx.doi.org/10.1007/BFb0057373">The stability index of graphs</a>, pp. 29-52 of Combinatorial Mathematics (Proceedings 2nd Australian Conf.), Lect. Notes Math. 403, 1974. Gives first 45 terms.
%H K. L. McAvaney, <a href="http://dx.doi.org/10.1007/BFb0057379">Counting stable trees</a>, pp. 79-85 of Combinatorial Mathematics (Proceedings 2nd Australian Conf.), Lect. Notes Math. 403, 1974.
%H <a href="/index/Tra#trees">Index entries for sequences related to trees</a>
%F a(n) = A000055(n) - A002988(n) + [n <= 2]. - _Sean A. Irvine_, Feb 13 2016
%F G.f.: t(x) - b(x) + x + x^2 where t(x) is the g.f. for A000055 and b(x) is the g.f. for A002988. - _Sean A. Irvine_, Feb 13 2016
%Y Cf. A006544 (forests).
%K nonn
%O 1,5
%A _N. J. A. Sloane_
%E More terms from _Sean A. Irvine_, Feb 13 2016
|
