login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A218462 Number of simple perfect matching graphs on 2n nodes. 3
1, 6, 101, 10413, 11557799 (list; graph; refs; listen; history; text; internal format)
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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 14 04:16 EDT 2021. Contains 345018 sequences. (Running on oeis4.)