Hi, I'm curious...
Does anyone know a more general formula for derangements for groups that contain two or more indistinguishable elements?
For example, how many ways you could rearrange the letters in FOOLISH so that no letter ends up in the same spot?
i.e. In the new arrangement, the letter "O" can't appear in the second or third positions.