Number of sequences in which the matches of a fully symmetric single-elimination tournament with 3^n players can be played if arbitrarily many matches can occur simultaneously and each match involves 3 players.
A381865
Number of sequences in which the matches of a fully symmetric single-elimination tournament with 3^n players can be played if arbitrarily many matches can occur simultaneously and each match involves 3 players.
Terms
- a(0) =1a(1) =1a(2) =13a(3) =308682013
External references
- oeis: A381865