This site is supported by donations to The OEIS Foundation.

 Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS". Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A260511 Number of signed permutations of length n that are sortable to the identity permutation by some sequence of cdr (context-directed reversal) moves. 1
 1, 3, 15, 120, 1227, 15188 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS K. L. M. Adamyk, E. Holmes, G. R. Mayfield, D. J. Moritz, M. Scheepers, B. E. Tenner, and H. C. Wauck, Sorting permutations: games, genomes, and cycles, arXiv:1410.2353 [math.CO], 2014. EXAMPLE a(2) = 3 because [1,2], [-1,2], and [1,-2] are sortable to the identity [1,2] using only context-directed reversal moves. CROSSREFS A249165 gives the number of unsigned permutations sortable by context-directed swaps; this is the analog for signed permutations and context-directed reversals. A260506 gives the number of signed permutations sortable by both cdr and cds moves together. This sequence is therefore always bounded by A260506. A000165 counts the total number of signed permutations. Sequence in context: A006454 A225115 A112228 * A093571 A093570 A107869 Adjacent sequences:  A260508 A260509 A260510 * A260512 A260513 A260514 KEYWORD nonn,more AUTHOR Caleb Stanford, Jul 27 2015 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.