This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A049313 Switching classes of tournaments on n nodes. 3
 1, 1, 1, 2, 2, 6, 12, 79, 792, 19576, 886288, 75369960, 11856006240, 3467430423264, 1893448825054528, 1938818712501985736, 3737086626658278741376, 13606268915761294708760704, 93863103860384959101157737728 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 LINKS L. Babai and P. J. Cameron, Automorphisms and enumeration of switching classes of tournaments, Electron. J. Combin., 7 (2000), no. 1, Research Paper 38, 25 pp. P. J. Cameron, Sequences realized by oligomorphic permutation groups, J. Integ. Seqs. Vol. 3 (2000), #00.1.5. FORMULA Same as for switching classes of graphs but summed only over "level" permutations (same power of 2 divides all cycle lengths) EXAMPLE a(4)=2: the "local orders" form one switching class and the class containing a 3-cycle dominating a point the other. CROSSREFS Cf. A002854. Sequence in context: A175516 A244656 A159322 * A049954 A049952 A019100 Adjacent sequences:  A049310 A049311 A049312 * A049314 A049315 A049316 KEYWORD nonn,nice AUTHOR EXTENSIONS More terms from Vladeta Jovovic, Mar 01 2000 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 December 7 09:33 EST 2019. Contains 329843 sequences. (Running on oeis4.)