M. K. Chari and M. Joswig, Complexes of discrete Morse functions, Disc. Math. 302 (2005), 39-51.
L. H. Clark, J. C. George and T. D. Porter, On the number of 1-factors in the n-cube, Congress. Numer., 127 (1997), 67-69.
D. Deford, Seating rearrangements on arbitrary graphs, 2013; http://www.math.dartmouth.edu/~ddeford/graphs.pdf. See Table 3.
N. Graham and F. Harary, The number of perfect matchings in a hypercube, Appl. Math. Lett., 1 (1988), 45-48.
P. R. J. Ostergard and V. H. Pettersson, Enumerating Perfect Matchings in n-Cubes, http://users.tkk.fi/~pat/papers/matching.pdf, 2012.
Ville Pettersson, Graph Algorithms for Constructing and Enumerating Cycles and Related Structures, Preprint 2015, https://aaltodoc.aalto.fi/bitstream/handle/123456789/17688/isbn9789526063652.pdf?sequence=1
J. Propp, Enumeration of matchings: problems and progress, pp. 255-291 in L. J. Billera et al., eds, New Perspectives in Algebraic Combinatorics, Cambridge, 1999 (see Problem 18).
Z. Skupien, How many perfect matchings does the graph of the n-cube have?, Discrete Math., 191 (1998), 251-252. [From N. J. A. Sloane, Feb 18 2012]
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
Table of n, a(n) for n=1..7.
Per Hakan Lundow, Computation of matching polynomials and the number of 1-factors in polygraphs, Research report, No 12, 1996, Department of Math., Umea University, Sweden.
J. Propp, Twenty open problems in enumeration of matchings.
J. Propp, Updated article
J. Propp, Enumeration of matchings: problems and progress, in L. J. Billera et al. (eds.), New Perspectives in Algebraic Combinatorics