Sure. I’ll quote from Wikipedia and modify it.

“In combinatorial mathematics, the ménage problem or problème des ménages asks for the number of different ways in which it is possible to seat a set of couples, labeled “A_n” and “B_n” accordingly, at a round dining table so that the A and B alternate and no two couples are sat next to each other such that A_n = B_m”.