On the problème des ménages (Q1096630)

The ménage problem can be stated as follows. There are n couples to be seated around a circular table. It is required that the men and women are seated alternately. If the wives have taken their seats, in how many ways can the n husbands be seated ? This problem is discussed extensively in \textit{J. Riordan}'s book: ``Introduction to combinatorial analysis'' (1958; Zbl 0078.008) (reprint 1980). The ménage problem arises in many different ways. The paper under review provides an interesting sketch of some of its history. It would provide a good starting point for a student project in enumeration (in fact, for several).