Find permutations meeting Tukey criteria
Find all permutations of 1:n fulfilling Tukey's criteria that there are no runs of 3 or more increases or decreases in a row. Tukey just uses the default n=5 and limit=2.
tukeyPermutes(n = 5, limit = 2)
n |
permutations from 1 to n |
limit |
the maximum number of increases or decreases in a row |
a list of vectors containing valid permutations
tukeyPermutes() tukeyPermutes(6,3)
Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.