

A048200


Minimal length pairexchange / setrotate sequence to reverse n distinct ordered elements.


3



0, 1, 2, 4, 10, 15, 23, 32, 42, 55, 67
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,3


COMMENTS

"Rotate" is always a leftrotate (moves leftmost element to the right end) and "Exchange" is always a pairexchange of the two leftmost elements.


LINKS

Table of n, a(n) for n=1..11.
Sai Satwik Kuppili, C++ program for generating the moves for a given n
Sai Satwik Kuppili, Bhadrachalam Chitturi, Exact Upper Bound for Sorting R_n with LE, University of Texas at Dallas (2019).


EXAMPLE

a(4) = 4 since "xrrx" is the shortest sequence reversing "ABCD". Explicitly, (begin) ABCD, (x)> BACD, (r)> ACDB, (r) > CDBA, (x)> DCBA.


CROSSREFS

Sequence in context: A217134 A333619 A128513 * A058201 A000947 A125245
Adjacent sequences: A048197 A048198 A048199 * A048201 A048202 A048203


KEYWORD

nonn,nice,more


AUTHOR

Tony Bartoletti


EXTENSIONS

a(11) added by Sai Satwik Kuppili, Srinath T, Bhadrachalam Chitturi, Jan 02 2019


STATUS

approved



