[go: up one dir, main page]
login
The OEIS is supported by the many generous donors to the OEIS Foundation.
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A218463
Number of simple connected perfect matching graphs on 2n nodes.
3
1, 5, 95, 10297, 11546911
(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, 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

Lookup Welcome Wiki Register Music Plot 2 Demos Index WebCam Contribute Format Style Sheet Transforms Superseeker Recents
The OEIS Community
Maintained by The OEIS Foundation Inc.
Last modified October 5 01:11 EDT 2024. Contains 376527 sequences.
License Agreements, Terms of Use, Privacy Policy