## Clustered k-Subsets

This post is mostly copied and pasted from my posts in this thread on MHF.

Problem statement: Let and let be the number of k-subsets of such that when the elements are ordered from least to greatest, the absolute difference of any two adjacent elements is less than . Find a formula or algorithm to determine for arbitrary .