|
Search: id:A125031
|
|
|
| A125031 |
|
Total number of highest scorers in all 2^(n(n-1)/2) tournaments with n players. |
|
+0
4
|
|
| 1, 2, 12, 104, 1560, 53184, 3422384, 430790144, 111823251840, 56741417927680, 57729973360342272
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
All highest scorers are also king chickens, A123553.
|
|
LINKS
|
Index entries for sequences related to tournaments
|
|
EXAMPLE
|
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
|
|
CROSSREFS
|
Cf. A006125, A013976, A123553, A125032, A123903.
Sequence in context: A157328 A061632 A104533 this_sequence A085867 A141133 A036077
Adjacent sequences: A125028 A125029 A125030 this_sequence A125032 A125033 A125034
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
Martin Fuller (martin_n_fuller(AT)btinternet.com), Nov 16 2006
|
|
EXTENSIONS
|
a(5)-a(10) also computed by Gordon Royle, Nov 16 2006
|
|
|
Search completed in 0.005 seconds
|
