The problem is given as follows:
There are n people sitting in n seats, with n $\geq$ 3 Any person can either stay in the same seat, or move to an adjacent seat. How many ways can this be done? A diagram is given with the problem and it is clear that the seats are considered fixed and rotations which end up in different seats are not considered equivalent.
Clearly the identity permutation is one. There are two rotations of one place, one clockwise and one counterclockwise. These three permutations exist for every n.
All other permutations fulfilling the conditions must consist solely of collections of 2-cycles or transpositions.
For n = 3 there are three possible transpositions, so the total number of permissible permutations for n = 3 is 6
For n = 4 we can have four possible transpositions, (AB)(BC)(CD) and (DA) If one of these transpositions is chosen and the other two elements are left unmoved, we have four choices so there are four possible permutations. If two transpositions are used, the first necessarily restricts the choice of the second so there are two possible permutations.
Thus there are 4 + 2 + 3 = 9 permissible permutations for n = 4
For n = 5 we can have one transposition, or two transpositions and a singleton left. There are five choices of single transpositions. If we use two transpositions there are five choices of singleton left over. There is a total of 5 + 5 + 3 = 13 permissible permutations for n = 5
I tried various combinatorics methods. A try at stars and bars, but placement of the bars is problematic; transpositions cannot overlap. For k transpositions, n - k objects of which k are pairs and n - 2k are singletons. Placement is problematic again because the pairs take two seats.
I was wondering if there might be a Fibonacci pattern as the number of permissible permutations grows rapidly. It occurred to me that perhaps odd and even n could be studied separately, doing induction on adding 2 each step.
I've been puzzling over this for a few days and have a few ideas but nothing has jelled yet