A186144 - OEIS

A186144

Number of elements in the symmetric group S_n whose distance from a fixed element is the group diameter under compositions of (1,2) and (1,2,...,n).

1, 1, 3, 3, 2, 1, 2, 1, 2, 1, 2, 1, 2

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,3

COMMENTS

a(n) is the number of elements in the symmetric group S_n that are maximally distant from any fixed element, where distance is taken to be the minimal sequence of operations composed from transposition (1,2) and rotation (1,2,...,n) producing one element from another. This maximal distance is the diameter of S_n under the stated compositions, given by A039745(n).

From Ben Whitmore, Nov 14 2020: (Start)

Conjecture (verified up to n = 13): Consider the a(n) permutations that take A039745(n) steps to reach the identity. For odd n>5, we have a(n) = 2 and the actions of these permutations on the list [1, 2, ..., n] are

[2, 1, (n+3)/2, n, n-1, ..., (n+5)/2, (n+1)/2, (n-1)/2, ..., 4, 3],

[2, 1, n-1, n-2, ..., (n+3)/2, n, (n+1)/2, (n-1)/2, ..., 4, 3],

and for even n>5, we have a(n) = 1 and the action of the permutation is

[2, n, 1, n-1, n-2, ..., 4, 3].

(End)

LINKS

Table of n, a(n) for n=1..13.

FORMULA

Conjecture: For n>4, a(n) = 1 if n is even, a(n) = 2 if n is odd. - Ben Whitmore, Nov 14 2020

CROSSREFS

Sequence in context: A283987 A286443 A075522 * A090544 A283755 A038766

Adjacent sequences: A186141 A186142 A186143 * A186145 A186146 A186147