Ménage problem

The Ménage problem is a classic problem in combinatorics that involves counting the number of ways to arrange couples such that no couple sits next to each other. Typically, the problem is stated with a specific number of couples, and the arrangements are considered around a circular table.