126565
domain: N
Appears in sequences
- Number of discordant permutations of length n.at n=9A000183
- Triangle read by rows: T(n,k) = number of permutations of [n] allowing i->i+j (mod n), j=0..k-1.at n=51A008305
- Triangle T(n,k) giving the number of permutations pi of {1,2,...,n} such that for all i, pi(i) is not in {i, i+1, ..., i+k-1} (mod n), with 0 <= k <= n - 1.at n=48A321352