Title: Forbidden Substrings In Circular K-Successions,
Abstract: In this note we define circular k-successions in permutations in one-line
notation and count permutations that avoid substrings j(j+k) and j(j+k) (mod
n). We also count circular permutations that avoid such substrings, and show
that for substrings j(j+k) (mod n), the number of permutations depends on
whether n is prime, and more generally, on whether n and k are relatively
prime.