%I A125031
%S A125031 1,2,12,104,1560,53184,3422384,430790144,111823251840,56741417927680,
%T A125031 57729973360342272
%N A125031 Total number of highest scorers in all 2^(n(n-1)/2) tournaments with 
               n players.
%C A125031 All highest scorers are also king chickens, A123553.
%H A125031 <a href="Sindx_To.html#tournament">Index entries for sequences related 
               to tournaments</a>
%e A125031 With 4 players there are 32 tournaments with 1 highest scorer, 24 tournaments 
               with 2 highest scorers and 8 tournaments with 3 highest scorers. 
               Therefore a(4)=32*1+24*2+8*3=104
%Y A125031 Cf. A006125, A013976, A123553, A125032, A123903.
%Y A125031 Sequence in context: A157328 A061632 A104533 this_sequence A085867 A141133 
               A036077
%Y A125031 Adjacent sequences: A125028 A125029 A125030 this_sequence A125032 A125033 
               A125034
%K A125031 more,nonn
%O A125031 1,2
%A A125031 Martin Fuller (martin_n_fuller(AT)btinternet.com), Nov 16 2006
%E A125031 a(5)-a(10) also computed by Gordon Royle, Nov 16 2006