  In this paper, we study the combinatorial structures of straight and ordinary
m\'enage permutations. Based on these structures, we prove four formulas. The
first two formulas define a relationship between the m\'enage numbers and the
Catalan numbers. The other two formulas count the m\'enage permutations by
number of cycles.
