|
%I #12 Apr 08 2019 03:41:33
%S 1,1,1,2,2,6,12,79,792,19576,886288,75369960,11856006240,
%T 3467430423264,1893448825054528,1938818712501985736,
%U 3737086626658278741376,13606268915761294708760704,93863103860384959101157737728
%N Switching classes of tournaments on n nodes.
%H L. Babai and P. J. Cameron, <a href="http://www.combinatorics.org/ojs/index.php/eljc/article/view/v7i1r38">Automorphisms and enumeration of switching classes of tournaments</a>, Electron. J. Combin., 7 (2000), no. 1, Research Paper 38, 25 pp.
%H P. J. Cameron, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL3/groups.html">Sequences realized by oligomorphic permutation groups</a>, J. Integ. Seqs. Vol. 3 (2000), #00.1.5.
%F Same as for switching classes of graphs but summed only over "level" permutations (same power of 2 divides all cycle lengths)
%e a(4)=2: the "local orders" form one switching class and the class containing a 3-cycle dominating a point the other.
%Y Cf. A002854.
%K nonn,nice
%O 1,4
%A _Peter J. Cameron_
%E More terms from _Vladeta Jovovic_, Mar 01 2000
|
