This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A260511 #10 Mar 24 2017 00:47:58 %S A260511 1,3,15,120,1227,15188 %N A260511 Number of signed permutations of length n that are sortable to the identity permutation by some sequence of cdr (context-directed reversal) moves. %H A260511 K. L. M. Adamyk, E. Holmes, G. R. Mayfield, D. J. Moritz, M. Scheepers, B. E. Tenner, and H. C. Wauck, <a href="http://arxiv.org/abs/1410.2353"> Sorting permutations: games, genomes, and cycles</a>, arXiv:1410.2353 [math.CO], 2014. %e A260511 a(2) = 3 because [1,2], [-1,2], and [1,-2] are sortable to the identity [1,2] using only context-directed reversal moves. %Y A260511 A249165 gives the number of unsigned permutations sortable by context-directed swaps; this is the analog for signed permutations and context-directed reversals. %Y A260511 A260506 gives the number of signed permutations sortable by both cdr and cds moves together. This sequence is therefore always bounded by A260506. %Y A260511 A000165 counts the total number of signed permutations. %K A260511 nonn,more %O A260511 1,2 %A A260511 _Caleb Stanford_, Jul 27 2015