The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A125031 Total number of highest scorers in all 2^(n(n-1)/2) tournaments with n players. 5
 1, 2, 12, 104, 1560, 53184, 3422384, 430790144, 111823251840, 56741417927680, 57729973360342272, 118195918779085344768, 479770203506298422135808, 3914602958361039682677710848, 63809077054456699374663196416000, 2076906726499655025703507210668998656 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS All highest scorers are also king chickens, A123553. LINKS Andrew Howroyd, Table of n, a(n) for n = 1..20 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. PROG (PARI) \\ Requires Winners from A013976. a(n)={my(M=Winners(n)); sum(i=1, matsize(M)[1], pollead(M[i, 1])*M[i, 2])} \\ Andrew Howroyd, Feb 29 2020 CROSSREFS Cf. A006125, A013976, A123553, A125032, A123903. Sequence in context: A104533 A216794 A218300 * A258230 A085867 A141133 Adjacent sequences:  A125028 A125029 A125030 * A125032 A125033 A125034 KEYWORD nonn AUTHOR Martin Fuller, Nov 16 2006 EXTENSIONS a(5)-a(10) also computed by Gordon Royle, Nov 16 2006 Terms a(12) and beyond from Andrew Howroyd, Feb 28 2020 STATUS approved

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

Last modified March 31 16:23 EDT 2020. Contains 333151 sequences. (Running on oeis4.)