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)
permutations from 1 to n
the maximum number of increases or decreases in a row
a list of vectors containing valid permutations
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.