[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!)
A287652
Number of simple disconnected perfect matching graphs on 2n nodes.
2
0, 1, 6, 116, 10888
(list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
Table of n, a(n) for n=1..5.
Eric Weisstein's World of Mathematics, Disconnected Graph
Eric Weisstein's World of Mathematics, Perfect Matching
FORMULA
a(n) = A218462(n) - A218463(n).
CROSSREFS
Cf. A218462 (simple not-necessarily connected perfect matching graphs).
Cf. A218463 (connected perfect matching graphs).
Sequence in context: A113015 A362765 A024275 * A259064 A300733 A332627
Adjacent sequences: A287649 A287650 A287651 * A287653 A287654 A287655
KEYWORD
nonn,more
AUTHOR
Eric W. Weisstein, May 29 2017
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 03:17 EDT 2024. Contains 376530 sequences.
License Agreements, Terms of Use, Privacy Policy