|
Search: id:A065603
|
|
|
| A065603 |
|
Maximal number of moves needed to sort n objects by moving blocks. |
|
+0
1
|
|
| 0, 1, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 8, 8, 9
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
Arises in sorting cards in a bridge hand; also in computational biology because block moves are a fundamental type of mutation.
|
|
REFERENCES
|
H. Eriksson et al., Sorting a bridge hand, Discrete Math., 241 (2001), 289-300.
|
|
LINKS
|
H. Eriksson et al., Sorting a bridge hand
Index entries for sequences related to sorting
|
|
FORMULA
|
It is conjectured that a(n) = ceiling((n+1)/2) for n >= 3 except for n = 13 and 15.
|
|
CROSSREFS
|
Sequence in context: A005410 A120835 A091374 this_sequence A084242 A156261 A071823
Adjacent sequences: A065600 A065601 A065602 this_sequence A065604 A065605 A065606
|
|
KEYWORD
|
nonn,nice,more
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Dec 02 2001
|
|
EXTENSIONS
|
Definition corrected by Peter Lipp, Dec 16 2008
|
|
|
Search completed in 0.002 seconds
|
