A218462 - OEIS

%I #18 Sep 05 2019 19:06:14

%S 1,6,101,10413,11557799

%N Number of simple perfect matching graphs on 2n nodes.

%C Perfect matchings exist only for graphs with an even number of nodes.

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/PerfectMatching.html">Perfect Matching</a>

%F a(n) = A218463(n) + A287652(n). - _Eric W. Weisstein_, May 29 2017

%F a(n) = A286951(2*n, n). - _Andrew Howroyd_, Sep 05 2019

%Y Cf. A218463 (connected simple perfect matching graphs).

%Y Cf. A287652 (disconnected simple perfect matching graphs).

%Y Cf. A286951.

%K nonn,more

%O 1,2

%A _Eric W. Weisstein_, Mar 26 2013