|
Search: id:A053195
|
|
|
| A053195 |
|
Number of level permutations of degree n. |
|
+0
3
|
|
| 1, 2, 3, 18, 45, 360, 1575, 20790, 99225, 1332450, 9823275, 181496700, 1404728325, 26221595400, 273922023375, 7196040101250, 69850115960625, 1662139682453250, 22561587455281875, 675158520854317500
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
A permutation is level if the powers of 2 dividing its cycle lengths are all equal.
For odd n, level permutations of degree n are just permutations that have odd order, i.e., A053195(2*n+1) = A000246(2*n+1). - Vladeta Jovovic, Sep 29 2004
|
|
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.
|
|
CROSSREFS
|
Cf. A049313, A053197.
Sequence in context: A163910 A064777 A137784 this_sequence A003693 A048047 A114165
Adjacent sequences: A053192 A053193 A053194 this_sequence A053196 A053197 A053198
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
Vladeta Jovovic (vladeta(AT)eunet.rs), Mar 02 2000
|
|
|
Search completed in 0.002 seconds
|
