478953648

Appears in sequences

• Number of aperiodic permutations of {1..n}.at n=11A324514
• Irregular table T(n, k), n >= 0, k = 1..max(1, n), read by rows; T(n, k) is the number of permutations s of { 1..n } such that p(s) = k where p(s) is the least m > 0 such that, working in Z/nZ, s(i) + m = s(i + m) for i = 1..n.at n=78A343488