cp's OEIS Frontend

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.

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.

Table of values

n a(n)
0 1
1 1
2 13
3 308682013
4 20447648974223714249697186722386536049691073

List of values

[1, 1, 13, 308682013, 20447648974223714249697186722386536049691073]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.