14684570

Appears in sequences

• Subfactorial or rencontres numbers, or derangements: number of permutations of n elements with no fixed points.at n=11A000166
• Triangle of rencontres numbers.at n=45A008291
• a(n) = floor( n! / e ).at n=10A014508
• Triangle read by rows: T(n,k) (n >= 1, 1 <= k <= n) = smallest permanent of any n X n (0,1) matrix with k 1's in each row and column.at n=64A133643
• Triangle read by rows: T(n,k) (n >= 1, 1 <= k <= n) = largest permanent of any n X n (0,1) matrix with k 1's in each row and column.at n=64A133644
• The subfactorial with index prime(n).at n=4A161744
• Triangle read by rows: T(n,k) is the number of permutations of [n] having no 3-sequences and having k successions (0 <= k <= floor(n/2)); a succession of a permutation p is a position i such that p(i +1) - p(i) = 1.at n=37A180185
• Triangle read by rows: T(n,k) is the number of permutations of [n] starting with 1, having no 3-sequences and having k successions (0 <= k <= floor(n/2)); a succession of a permutation p is a position i such that p(i +1) - p(i) = 1.at n=42A180186
• Triangle read by rows: T(n,k) is the number of permutations of [n] having k fixed blocks.at n=41A180192
• 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=11A257953
• Number of permutations p of [n] with no fixed points and displacement of elements restricted by ten: 1 <= |p(i)-i| <= 10.at n=11A259783
• 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=11A260091
• Number of permutations p of [n] with no fixed points and cyclic displacement of elements restricted by five: p(i)<>i and (i-p(i) mod n <= 5 or p(i)-i mod n <= 5).at n=11A260094
• Number of permutations p of [n] with no fixed points and cyclic displacement of elements restricted by six: p(i)<>i and (i-p(i) mod n <= 6 or p(i)-i mod n <= 6).at n=11A260111
• 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=11A260115
• 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=11A260216
• Triangle read by rows: T(n-1,k), where n >= 2 and 1 <= k <= floor(n/2), is the number of permutations of (1, 2, ..., n) having k consecutive pairs but no consecutive sequences of length greater than 2.at n=25A289632
• Number T(n,k) of permutations p of [n] such that |p(j)-j| >= k (for all j in [n]); triangle T(n,k), n >= 0, 0 <= k <= floor(n/2), read by rows.at n=37A306543
• Triangular table of coefficients of p in p^(k+2)/(1-p) LerchPhi(1-p,-1-k,(p-1)/p) as function of k=1..n.at n=45A308804
• a(n) = A000166(floor(n/2)) if n is even otherwise A000240(floor((n + 1)/2)).at n=22A371998