Find a closed formula in terms of m, s(m,4)?
s(m,1) seems easy enough. Just 1 cycle. Arrange the m numbers in m! ways. Then each number can be shifted one place to right m times to get same cycle. Hence s(m,1)=(m-1)! How to go about doing for s(m,4)? Could we do this without giving some explicit formula. I would like to understand how to do this by just counting.