I’m looking at the amount of possible combinations of single stroke rolls using varying amount of limbs.
Let’s use these letters for reference
- R is right hand.
- L is left hand.
- r is right foot.
- l is left foot.
There is one variation for one limb: R. There are two variations for two limbs: RL
and LR. There are six variations for three limbs:
- RLr
- RrL
- LRr
- LrR
- rRL
- rLR
I won’t list them all, but there are 24 combinations for four limbs. Here is the first one:
- RLrl
- RLlr
- RrLl
- RrlR
- RlLr
- RlrL
That leads to the following ratios: $1:1$, $2:2$, $3:6$ and $4:24$. That would leave me to believe the next pair of numbers to continue the pattern would be $5:120$.
Is there an equation that I can use to solve for number of variations using different numbers of limbs using only one limb once?
You are trying to count, for each fixed number $n$ the number of ways to arrange the numbers $1, 2, 3, \dots, n$ in a sequence, using each number exactly once. These are called permutations of $1, 2, 3, \dots, n$. The number of permutations of $1, 2, 3, \dots, n$ is called "$n$ factorial", written $n!$, and is equal to $n! = (n) (n-1)(n-2) \cdots (2) (1)$. The reason is that you have $n$ choices to fill the first position, $n-1$ choices to fill the second position, etc.