32071101049
domain: N
Appears in sequences
- Subfactorial or rencontres numbers, or derangements: number of permutations of n elements with no fixed points.at n=14A000166
- a(n) = ceiling(n!/e) with e = A001113 = exp(1).at n=14A174318
- a(0) = 1, a(n) = 1 - n * a(n-1).at n=14A182386
- Number of permutations p of [n] with no fixed points and cyclic displacement of elements restricted by nine: p(i)<>i and (i-p(i) mod n <= 9 or p(i)-i mod n <= 9).at n=14A257953
- Number of permutations p of [n] with no fixed points and cyclic displacement of elements restricted by seven: p(i)<>i and (i-p(i) mod n <= 7 or p(i)-i mod n <= 7).at n=14A260091
- Number of permutations p of [n] with no fixed points and cyclic displacement of elements restricted by eight: p(i)<>i and (i-p(i) mod n <= 8 or p(i)-i mod n <= 8).at n=14A260115
- Number of permutations p of [n] with no fixed points and cyclic displacement of elements restricted by ten: p(i)<>i and (i-p(i) mod n <= 10 or p(i)-i mod n <= 10).at n=14A260216
- Number of permutations p of [2n] having no index i with |p(i)-i| = n.at n=7A306535
- a(n) = A000166(floor(n/2)) if n is even otherwise A000240(floor((n + 1)/2)).at n=28A371998