A139541 There are 4*n players who wish to play bridge at n tables. Each player must have another player as partner and each pair of partners must have another pair as opponents. The choice of partners and opponents can be made in exactly a(n)=(4*n)!/(n!*8^n) different ways.
1, 3, 315, 155925, 212837625, 618718975875, 3287253918823875, 28845653137679503125, 388983632561608099640625, 7637693625347175036443671875, 209402646126143497974176151796875, 7752714167528210725497923667975703125, 377130780679409810741846496828678078515625
Offset: 0
Keywords
References
- G. Pólya and G. Szegő, Problems and Theorems in Analysis II (Springer 1924, reprinted 1976), Appendix: Problem 203.1, p164.
Links
- Andrew Howroyd, Table of n, a(n) for n = 0..100
- Eric Weisstein's World of Mathematics, Tournament
- Index entries for sequences related to tornaments.
Programs
-
PARI
a(n)={(4*n)!/(n!*8^n)} \\ Andrew Howroyd, Jan 07 2020
Formula
Extensions
Terms a(11) and beyond from Andrew Howroyd, Jan 07 2020
Comments