2293839

Appears in sequences

• The game of Mousetrap with n cards (given n letters and n envelopes, how many ways are there to fill the envelopes so that at least one letter goes into its right envelope?).at n=10A002467
• Triangle read by rows: T(n,k) is the number of permutations of [n] for which the shortest cycle length is k (1<=k<=n).at n=45A145877
• Triangular array read by rows. T(n,k) is the number of n-permutations that have at least k fixed points with n >= 1 and 1 <= k <= n.at n=45A208956
• Triangle T(n,k) is the number of permutations on n elements with at least one k-cycle for 1 <= k <= n.at n=45A293211
• Number T(n,k) of permutations p of [n] such that min_{j=1..n} |p(j)-j| = k; triangle T(n,k), n >= 0, 0 <= k <= floor(n/2), read by rows.at n=30A299789
• Number of permutations p of [2n] having at least one index i with |p(i)-i| = n.at n=5A306675
• Total number of occurrences of k in the (signed) displacement sets of all permutations of [n+k] divided by k!; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=65A324362
• Number T(n,k) of permutations p of [n] such that k is the maximum of 0 and the number of elements in any integer interval [p(i)..i+n*[i<p(i)]]; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=65A324563
• Number T(n,k) of permutations p of [n] such that n-k is the maximum of 0 and the number of elements in any integer interval [p(i)..i+n*[i<p(i)]]; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=55A324564
• Number of permutations p of [n] such that ten is the maximum of the number of elements in any integer interval [p(i)..i+n*[i<p(i)]].at n=0A324637
• Triangle read by rows: T(n,k) = n * T(n-1,k) + (-1)^(n-k) for 0 <= k <= n with initial values T(n,k) = 0 if n < 0 or k < 0 or k > n.at n=56A352650
• Triangle read by rows. Convolution triangle of A002467 (number of permutations with fixed points).at n=56A357586
• T(n, k) = Sum_{m = 0..n-1} Stirling1(m+1, k)*binomial(n, m)*(-1)^(n + k), where "Stirling1" are the signed Stirling numbers of the first kind.at n=45A367198