OFFSET
1,4
COMMENTS
In the n-Bruhat graph, 6-cycles can be of three types: 1) those that move only three adjacent points of the permutation, 2) those that move five points with two being adjacent and the other three being adjacent, 3) those that move a total of six points consisting of three pairs of adjacent points. - Andrew Howroyd, Jul 31 2018
LINKS
Andrew Howroyd, Table of n, a(n) for n = 1..200
Eric Weisstein's World of Mathematics, Bruhat Graph
Eric Weisstein's World of Mathematics, Graph Cycle
FORMULA
a(n) = n!*((n-2)/6 + (n-3)*(n-4)/2 + (n-3)*(n-4)*(n-5)/3) for n > 2. - Andrew Howroyd, Jul 31 2018
EXAMPLE
From Andrew Howroyd, Jul 31 2018: (Start)
Case n=3: Vertices are permutations on S_3. There is only one cycle:
(123)->(213)->(231)->(321)->(312)->(132)->(123).
Case n=5: An example of a 6-cycle that moves all 5 points:
(12345)->(21345)->(23145)->(23154)->(21354)->(12354)->(12345).
(End)
PROG
(PARI) a(n) = n!*if(n<3, 0, (n-2)/6 + (n-3)*(n-4)/2 + (n-3)*(n-4)*(n-5)/3); \\ Andrew Howroyd, Jul 31 2018
CROSSREFS
KEYWORD
nonn
AUTHOR
Eric W. Weisstein, Jul 29 2018
EXTENSIONS
Terms a(10) and beyond from Andrew Howroyd, Jul 31 2018
STATUS
approved