Number of ways 2*n-1 people can vote on three candidates so that the Condorcet paradox arises.

Terms

a(0) =0a(1) =2a(2) =12a(3) =42a(4) =112a(5) =252a(6) =504a(7) =924a(8) =1584a(9) =2574a(10) =4004a(11) =6006a(12) =8736a(13) =12376a(14) =17136a(15) =23256a(16) =31008a(17) =40698a(18) =52668a(19) =67298a(20) =85008a(21) =106260a(22) =131560a(23) =161460a(24) =196560a(25) =237510a(26) =285012a(27) =339822a(28) =402752a(29) =474672