a(n) is the number of permutations p of {1,..,n} such that the minimum number of block interchanges required to sort the permutation p to the identity permutation is maximized.
A260695
a(n) is the number of permutations p of {1,..,n} such that the minimum number of block interchanges required to sort the permutation p to the identity permutation is maximized.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =5a(4) =8a(5) =84a(6) =180a(7) =3044a(8) =8064a(9) =193248a(10) =604800a(11) =19056960a(12) =68428800a(13) =2699672832a(14) =10897286400a(15) =520105017600
External references
- oeis: A260695