1As even as possible
Put n steps round a circle and choose k of them to hit. When k divides n the answer is obvious: every n/k steps. When it doesn't, some gaps must be longer than others, and the most even choice uses only two gap lengths, ⌊n/k⌋ and ⌈n/k⌉, spread out as well as they will go. That one rule, maximal evenness, picks out the tresillo's 3-3-2 from all 56 ways of choosing 3 of 8.
Right now: … uses gaps of ….
gaps ∈ { ⌊n/k⌋, ⌈n/k⌉ }only two gap lengths, never threen/k = … → …
#long gaps = n mod khow many gaps get the extra step…