Lehmer-Stanley-Baltic Rational Generating Functions for Enumerating CIRCULAR permutations
that don't go very far, Using a Zeilberger-style, Empirical-Yet-Rigorous , Dumb-Yet-Clever, Approach
By Shalosh B. Ekhad
Let F[S](t) be the generating function, in t, for the number of
CIRCULAR permutations of {1, ...n} such that pi[i]-i is always in S, where \
things get wraped up.
In this article we will derive, empirically-yet-rigorously,
Lehmer-Stanley-Baltic rational generating functions for all sets S of the fo\
rm
{a,a+1, .., b} for -N<=a<-1<1