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”).
%I #11 Feb 02 2020 21:36:12
%S 1,1,2,8,336,356788059,607158046495120886820621
%N Number of equivalence classes of perfect matchings in the n-cube.
%H N. Graham and F. Harary, <a href="https://doi.org/10.1016/0893-9659(88)90173-5">The number of perfect matchings in a hypercube</a>, Appl. Math. Lett., 1 (1988), 45-48.
%H Patric R. J. Östergård and V. H. Pettersson, <a href="https://doi.org/10.1007/s11083-012-9279-8">Enumerating Perfect Matchings in n-Cubes</a>, Order, November 2013, Volume 30, Issue 3, pp 821-835.
%H Ville Pettersson, <a href="https://aaltodoc.aalto.fi/bitstream/handle/123456789/17688/isbn9789526063652.pdf?sequence=1">Graph Algorithms for Constructing and Enumerating Cycles and Related Structures</a>, Preprint 2015.
%Y Cf. A005271.
%K nonn
%O 1,3
%A _N. J. A. Sloane_, Jan 01 2013