I am trying to find the number of cyclic permutations ,$A(n)$, of $\{1,2,3,...,n\}$ without any two consecutive integers together. The second part of the problem is to prove that $A(n+1)+A(n)=D(n)$ [derangement numbers]
Any help on how to start this would be appreciated!