A219116 Number of semicomplete digraphs on n nodes with an "Emperor".

0, 1, 2, 9, 108, 3645, 354294, 100442349, 83682825624, 205891132094649, 1500946352969991210, 32497439772059170685073, 2093390532109442148854046084, 401741006974223960704968343445877, 229924845755649214047240549209929574046

Offset

0,3

Comments

a(n) is also the number of asymmetric digraphs on n nodes with an "Emperor".

Links

Table of n, a(n) for n=0..14.

Formula

a(n) = n*3^((n^2 - 3*n + 2)/2).

Prog

(Maxima) A219116(n):=n*3^((n^2-3*n+2)/2)$ makelist(A219116(n), n, 0, 14); /* Martin Ettl, Nov 13 2012 */

Crossrefs

See also A123903 for tournaments and A217652 for digraphs.

Sequence in context: A341056 A309452 A354663 * A245731 A290714 A062498

Adjacent sequences: A219113 A219114 A219115 * A219117 A219118 A219119

Keyword

nonn

Author

Rémy-Robert Joseph, Nov 12 2012

Status

approved