cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A287652 Number of simple disconnected perfect matching graphs on 2n nodes.

Original entry on oeis.org

0, 1, 6, 116, 10888
Offset: 1

Views

Author

Eric W. Weisstein, May 29 2017

Keywords

Crossrefs

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

Formula

a(n) = A218462(n) - A218463(n).