Kaplansky, Irving Solution of the ’Problème des ménages’. (English) Zbl 0060.02904 Bull. Am. Math. Soc. 49, 784-785 (1943). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 5 ReviewsCited in 35 Documents MSC: 05A05 Permutations, words, matrices Keywords:combinatorics; marriage problem PDFBibTeX XMLCite \textit{I. Kaplansky}, Bull. Am. Math. Soc. 49, 784--785 (1943; Zbl 0060.02904) Full Text: DOI Online Encyclopedia of Integer Sequences: Ménage numbers: a(0) = 1, a(1) = -1, and for n >= 2, a(n) = number of permutations s of [0, ..., n-1] such that s(i) != i and s(i) != i+1 (mod n) for all i.