131642

Appears in sequences

• From the game of Mousetrap.at n=9A018934
• Triangle read by rows: T(n,k) is the number of non-derangements of {1,2,...,n} for which the difference between the largest and smallest fixed points is k (n>=1; 0 <= k <= n-1).at n=48A161129
• Triangle read by rows: T(n, k) = Sum_{t=k..n-2} (-1)^(t-k)*(n-t)!*binomial(t,k)*binomial(n-2,t).at n=29A264027
• Triangle read by rows: T(n,k) = (-1)^(n+1) * A000166(n) + (-1)^(k) * A000166(k) for n >= 2 and 1 <= k <= n-1.at n=34A373966