In combinatorial mathematics, a derangement is a permutation of the elements of a set, such that no element appears in its original position.
The number of derangements of a set of size n, usually written Dn, dn, or !n, is called the "derangement number" or "de Montmort number". (These numbers are generalized to rencontres numbers.) The subfactorial function (not to be confused with the factorial n!) maps n to !n.
No standard notation for subfactorials is agreed upon; n¡ is sometimes used instead of !n.
see subfactorial or derangement https://en.wikipedia.org/wiki/Derangement
see also: https://web2.0calc.com/questions/what-does-the-meaan