login
A373777
For an oriented graph D, let X_m(D) be the number of copies of D in a random tournament (i.e., a complete graph, each of whose edges is directed randomly with probability 1/2 for each direction) on m vertices. a(n) is the denominator of the minimum limit, as m tends to infinity, of Var(X_m(D))/m^A373775(n) over all weakly connected oriented graphs D on n vertices.
2
1, 1, 32, 1, 2048, 256, 2147483648, 1
OFFSET
1,3
CROSSREFS
Cf. A373775, A373776 (numerators).
Sequence in context: A221193 A103325 A351245 * A221760 A037932 A285417
KEYWORD
nonn,frac,more
AUTHOR
STATUS
approved