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.

Showing 1-2 of 2 results.

A218462 Number of simple perfect matching graphs on 2n nodes.

Original entry on oeis.org

1, 6, 101, 10413, 11557799
Offset: 1

Views

Author

Eric W. Weisstein, Mar 26 2013

Keywords

Comments

Perfect matchings exist only for graphs with an even number of nodes.

Links

Crossrefs

Cf. A218463 (connected simple perfect matching graphs).
Cf. A287652 (disconnected simple perfect matching graphs).
Cf. A286951.

Formula

a(n) = A218463(n) + A287652(n). - Eric W. Weisstein, May 29 2017
a(n) = A286951(2*n, n). - Andrew Howroyd, Sep 05 2019

A218463 Number of simple connected perfect matching graphs on 2n nodes.

Original entry on oeis.org

1, 5, 95, 10297, 11546911
Offset: 1

Views

Author

Eric W. Weisstein, Mar 26 2013

Keywords

Comments

Perfect matchings exist only for graphs with an even number of nodes.

Links

Crossrefs

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

Formula

a(n) = A218462(n) - A287652(n). - Eric W. Weisstein, May 29 2017
Inverse Euler transform of A218462. - Andrew Howroyd, Nov 03 2017
Showing 1-2 of 2 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.