A139541 - cp's OEIS frontend

A139541 There are 4n 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)=(4n)!/(n!*8^n) different ways.

n	a(n)
0	1
1	3
2	315
3	155925
4	212837625
5	618718975875
6	3287253918823875
7	28845653137679503125
8	388983632561608099640625
9	7637693625347175036443671875
10	209402646126143497974176151796875
11	7752714167528210725497923667975703125
12	377130780679409810741846496828678078515625

[1, 3, 315, 155925, 212837625, 618718975875, 3287253918823875, 28845653137679503125, 388983632561608099640625, 7637693625347175036443671875, 209402646126143497974176151796875, 7752714167528210725497923667975703125, 377130780679409810741846496828678078515625]

cp's OEIS Frontend

A139541 There are 4n 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)=(4n)!/(n!*8^n) different ways.

Table of values

List of values

cp's OEIS Frontend

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.

Table of values

List of values

A139541 There are 4n 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)=(4n)!/(n!*8^n) different ways.