A330637 Number of n-team football tournament outcomes that can be obtained in a single way. Each team plays each other team once, where 3 points are awarded to the winning team and 1 to each team in the case of a draw.

1, 2, 6, 25, 106, 436, 1795, 7487

Offset

1,2

Comments

Since such outcomes are obtained in a single way, their individual games can be uniquely reconstructed. This allows them to be used in a reconstruction puzzle (see links).

Links

Table of n, a(n) for n=1..8.

Dmitry Kamenetsky, Reconstructing the results of a 5-team soccer tournament, Puzzling StackExchange, 2019.

Dmitry Kamenetsky, Reconstructing the results of a 6-team soccer tournament, Puzzling StackExchange, 2019.

Example

For 2 teams there are 2 outcomes that can be obtained in a single way: [0, 3] and [1, 1], so a(2) = 2.
For 3 teams there are 6 outcomes that can be obtained in a single way: [0, 3, 6], [1, 3, 4], [1, 1, 6], [1, 2, 4], [0, 4, 4] and [2, 2, 2], so a(3) is 6. Note that the outcome [3, 3, 3] can be obtained in two ways: (A beats B, B beats C, C beats A) or (B beats A, A beats C, C beats B).

Crossrefs

Cf. A064626 counts all outcomes.

Sequence in context: A028302 A064811 A074418 * A003454 A199241 A366236

Adjacent sequences: A330634 A330635 A330636 * A330638 A330639 A330640

Keyword

nonn,more,hard

Author

Dmitry Kamenetsky, Dec 22 2019

Extensions

a(7) from Giovanni Resta, Jan 02 2020

a(8) from Andrew Howroyd, Feb 28 2020

Status

approved