A220904 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A220904

Number of equivalence classes of perfect matchings in the n-cube.

1

1, 1, 2, 8, 336, 356788059, 607158046495120886820621

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,3

LINKS

Table of n, a(n) for n=1..7.

N. Graham and F. Harary, The number of perfect matchings in a hypercube, Appl. Math. Lett., 1 (1988), 45-48.

Patric R. J. Östergård and V. H. Pettersson, Enumerating Perfect Matchings in n-Cubes, Order, November 2013, Volume 30, Issue 3, pp 821-835.

Ville Pettersson, Graph Algorithms for Constructing and Enumerating Cycles and Related Structures, Preprint 2015.

CROSSREFS

Sequence in context: A013003 A009707 A013176 * A009489 A102597 A009836

Adjacent sequences: A220901 A220902 A220903 * A220905 A220906 A220907

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Jan 01 2013

STATUS

approved