login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

The number of k-cycles in the symmetric group on k symbols whose commutator with the standard k-cycle (1,2,...,k) is a k-cycle, where k = 2n-1.
0

%I #18 Mar 25 2018 10:33:19

%S 1,0,10,112,7848,525888

%N The number of k-cycles in the symmetric group on k symbols whose commutator with the standard k-cycle (1,2,...,k) is a k-cycle, where k = 2n-1.

%C With the exception of the second term, it is not hard to prove that the sequence increases monotonically. Empirically, the growth is super-exponential.

%C For even k, there are no such k-cycles in S_k whose commutator with the standard k-cycle is a k-cycle.

%K nonn,more

%O 1,3

%A _Tarik Aougab_, Jan 11 2018