A218462 Number of simple perfect matching graphs on 2n nodes.

1, 6, 101, 10413, 11557799

Offset

1,2

Comments

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

Links

Table of n, a(n) for n=1..5.

Eric Weisstein's World of Mathematics, Perfect Matching

Formula

a(n) = A218463(n) + A287652(n). - Eric W. Weisstein, May 29 2017

a(n) = A286951(2*n, n). - Andrew Howroyd, Sep 05 2019

Crossrefs

Cf. A218463 (connected simple perfect matching graphs).

Cf. A287652 (disconnected simple perfect matching graphs).

Cf. A286951.

Sequence in context: A197066 A266683 A196960 * A065990 A306406 A344400

Adjacent sequences: A218459 A218460 A218461 * A218463 A218464 A218465

Keyword

nonn,more

Author

Eric W. Weisstein, Mar 26 2013

Status

approved