login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A047729 Number of score sequences in tournament with n players, when 3 points are awarded in each game. 8

%I #23 Jul 08 2023 19:24:37

%S 1,2,8,37,198,1178,7548,50944,357855,2595250,19313372,146815503,

%T 1136158495,8927025989,71065654235,572215412354,4653746621835,

%U 38184724333615,315792633485360,2630183440412617,22046522161472304

%N Number of score sequences in tournament with n players, when 3 points are awarded in each game.

%D P. A. MacMahon, Chess tournaments and the like treated by the calculus of symmetric functions, Coll. Papers I, MIT Press, 344-375.

%H Qihao Ye, <a href="/A047729/b047729.txt">Table of n, a(n) for n = 1..1032</a>

%H C. Bebeacua, T. Mansour, A. Postnikov and S. Severini, <a href="https://arxiv.org/abs/math/0506334">On the X-rays of permutations</a>, arXiv:math/0506334 [math.CO], 2005.

%H <a href="/index/To#tournament">Index entries for sequences related to tournaments</a>

%F Nonnegative integer points (p_1, p_2, ..., p_n) in polytope p_0=p_{n+1}=0, 2p_i -(p_{i+1}+p_{i-1}) <= 3, p_i >= 0, i=1, ..., n.

%Y Cf. A000571, A007747.

%K nonn

%O 1,2

%A _David W. Wilson_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 15:16 EDT 2024. Contains 371780 sequences. (Running on oeis4.)