login
A218462
Number of simple perfect matching graphs on 2n nodes.
3
1, 6, 101, 10413, 11557799
OFFSET
1,2
COMMENTS
Perfect matchings exist only for graphs with an even number of nodes.
LINKS
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
KEYWORD
nonn,more
AUTHOR
Eric W. Weisstein, Mar 26 2013
STATUS
approved