This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A330637 #15 Feb 29 2020 15:11:04 %S A330637 1,2,6,25,106,436,1795,7487 %N 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. %C A330637 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). %H A330637 Dmitry Kamenetsky, <a href="https://puzzling.stackexchange.com/questions/91913/reconstructing-the-results-of-a-5-team-soccer-tournament">Reconstructing the results of a 5-team soccer tournament</a>, Puzzling StackExchange, 2019. %H A330637 Dmitry Kamenetsky, <a href="https://puzzling.stackexchange.com/questions/92000/reconstructing-the-results-of-a-6-team-soccer-tournament">Reconstructing the results of a 6-team soccer tournament</a>, Puzzling StackExchange, 2019. %e A330637 For 2 teams there are 2 outcomes that can be obtained in a single way: [0, 3] and [1, 1], so a(2) = 2. %e A330637 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). %Y A330637 Cf. A064626 counts all outcomes. %K A330637 nonn,more,hard %O A330637 1,2 %A A330637 _Dmitry Kamenetsky_, Dec 22 2019 %E A330637 a(7) from _Giovanni Resta_, Jan 02 2020 %E A330637 a(8) from _Andrew Howroyd_, Feb 28 2020