693840
domain: N
Appears in sequences
- Triangle T(n,k) read by rows, where T(n,k) = number of times the permanent of a real nonsingular n X n (0,1)-matrix takes the value k, for n >= 1, 1 <= k <= A000255(n).at n=17A089480
- a(n) is the number of partial bijections (or subpermutations) of an n-element set without fixed points (also called partial derangements).at n=8A144085
- T(n,k) is the number of partial bijections (or subpermutations) of an n-element set with exactly k fixed points.at n=36A144088
- T(n,k) = number of n X k nonnegative integer arrays with new values 0 upwards introduced in row major order and every value unique in its row and column.at n=37A211709
- Triangle read by rows: T(n,k) is the number of subpermutations of an n-set whose orbits are each of size at most k, and without fixed points. Equivalently, T(n,k) is the number of partial derangements of an n-set each of whose orbits is of size at most k.at n=44A261762
- Array read by downward antidiagonals: A(n,k) = -A(n-1,k) + (k+1)*A(n-1,k+1) + A(n-1,k+2) with A(0,k) = 1, n >= 0, k >= 0.at n=44A369292