On the Condorcet Paradox

73 Views Asked by At

The OEIS sequence A277935 gives the number of ways 2n-1 people can vote on three candidates such that the Condorcet paradox arises. Is there a general formula for the number of ways $n$ people can vote on $k$ candidates so that the Condorcet paradox arises?