# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a007860
Showing 1-1 of 1

%I A007860 #18 Feb 08 2018 15:26:03
%S A007860 1,1,4,12,44,175,718,3052,13308,59139,266974,1220879,5643562,26327769,
%T A007860 123793450,586078393,2791408028,13365916545,64302770488,310672722803,
%U A007860 1506737267266,7332920012492,35800278685252,175286440178448,860517328379634,4234766396436095
%N A007860 Maximal matchings in rooted plane trees on n nodes.
%H A007860 M. Klazar, <a href="http://dx.doi.org/10.1006/eujc.1995.0095">Twelve countings with rooted plane trees</a>, European Journal of Combinatorics 18 (1997), 195-210; Addendum, 18 (1997), 739-740.
%H A007860 <a href="/index/Ro#rooted">Index entries for sequences related to rooted trees</a>
%F A007860 G.f. f(x) satisfies f(x)^7 - (6+x) * f(x)^6 + (15+6*x) * f(x)^5 + (x^2-15*x-20) * f(x)^4 - (2*x^2-20*x-15) * f(x)^3 - (15*x+6) * f(x)^2 + (2*x^2+6*x+1) * f(x) + x^4 - x^2 - x = 0 [from Klazar]. - _Sean A. Irvine_, Feb 07 2018
%K A007860 nonn
%O A007860 1,3
%A A007860 Martin Klazar (klazar(AT)kam.mff.cuni.cz)
%E A007860 a(1) corrected and more terms from _Sean A. Irvine_, Feb 07 2018

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE