The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A219116 Number of semicomplete digraphs on n nodes with an "Emperor". 2
 0, 1, 2, 9, 108, 3645, 354294, 100442349, 83682825624, 205891132094649, 1500946352969991210, 32497439772059170685073, 2093390532109442148854046084, 401741006974223960704968343445877, 229924845755649214047240549209929574046 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS a(n) is also the number of asymmetric digraphs on n nodes with an "Emperor". LINKS 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: A012986 A341056 A309452 * A245731 A290714 A062498 Adjacent sequences:  A219113 A219114 A219115 * A219117 A219118 A219119 KEYWORD nonn AUTHOR Rémy-Robert Joseph, Nov 12 2012 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 23 09:59 EDT 2021. Contains 345397 sequences. (Running on oeis4.)