%I
%S 0,0,5,13,1732,10705,697733,6539451
%N Number of ways to write the numbers 1 through 3n on the faces of three nsided dice, so that the 1st die beats the 2nd with probability > 1/2, the 2nd beats the 3rd with probability > 1/2 and the 3rd beats the 1st with probability > 1/2.
%D M. Gardner, "Mathematical Games: The Paradox of the Nontransitive Dice and the Elusive Principle of Indifference." Sci. Amer. 223, 110114, Dec. 1970.
%H Lee J. Stemkoski, <a href="http://home.adelphi.edu/~StemkosL/mathematrix/dice.html">Nontransitive Dice</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/EfronsDice.html">Efron's Dice.</a>
%e a(3)=5:
%e Set 1:
%e Die 1: 1 5 9
%e Die 2: 3 4 8
%e Die 3: 2 6 7
%e Set 2:
%e Die 1: 1 7 8
%e Die 2: 4 5 6
%e Die 3: 2 3 9
%e Set 3:
%e Die 1: 1 7 8
%e Die 2: 3 5 6
%e Die 3: 2 4 9
%e Set 4:
%e Die 1: 1 6 8
%e Die 2: 4 5 7
%e Die 3: 2 3 9
%e Set 5:
%e Die 1: 1 6 8
%e Die 2: 3 5 7
%e Die 3: 2 4 9
%K more,nonn
%O 1,3
%A Mikhail Dvorkin (dvorkin_m(AT)yahoo.com), Dec 11 2006
%E a(1) corrected by _Jon E. Schoenfield_, May 19 2007
%E a(6) and a(7) from _Jon E. Schoenfield_, May 19 2007
%E a(8) from _Jon E. Schoenfield_, May 23 2007
