A note on the generation of rosary permutations
Ronald C. Read · Communications of the ACM · 1972
Harada [1] has given a method of generating rosary permutations, and of associating an integer with each such permutation in a one-to-one manner. In this note we show that both these ends can be achieved more easily than by Harada's method.