A218463 Number of simple connected perfect matching graphs on 2n nodes.

1, 5, 95, 10297, 11546911

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, Connected Graph

Eric Weisstein's World of Mathematics, Perfect Matching

Formula

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

Inverse Euler transform of A218462. - Andrew Howroyd, Nov 03 2017

Crossrefs

Cf. A218462 (not-necessarily-connected simple perfect matching graphs).

Cf. A287652 (disconnected simple perfect matching graphs).

Sequence in context: A263394 A336942 A193478 * A192343 A152839 A266245

Adjacent sequences: A218460 A218461 A218462 * A218464 A218465 A218466

Keyword

nonn,more

Author

Eric W. Weisstein, Mar 26 2013

Status

approved