Suppose I have an alphabetized list of n people, and I want to choose k from the list such that any two people are at least g away from each other on the list
(E.g if g=2, then none of the k people are next to each other on the list).
Is there a formula / general way to solve these types of problems, for any k,n, and g?