1334961

Appears in sequences

• Subfactorial or rencontres numbers, or derangements: number of permutations of n elements with no fixed points.at n=10A000166
• Triangle T(n,k) of rencontres numbers (number of permutations of n elements with k fixed points).at n=55A008290
• Triangle of rencontres numbers.at n=36A008291
• Triangle read by rows: T(n,k) = number of permutations of [n] allowing i->i+j (mod n), j=0..k-1.at n=53A008305
• Triangle read by rows: T(n,k) is the number of permutations of [n] having k consecutive ascending pairs (0 <= k <= n-1).at n=53A010027
• 10th differences of factorial numbers.at n=0A023047
• Triangle of numbers of permutations eliminating just k cards out of n in game of Mousetrap.at n=55A028305
• Triangular array formed from successive differences of factorial numbers, then with factorials removed.at n=65A060475
• Table T(n,k) giving number of ways of obtaining exactly one correct answer on an (n,k)-matching problem (1 <= k <= n).at n=53A076732
• Transposed version of A080955: T(n,k) = A080955(k,n), n>=0, k>=-1.at n=65A089258
• Triangle read by rows: T(n,k) = number of partial derangements, that is, the number of permutations of n distinct, ordered items in which exactly k of the items are in their natural ordered positions, for n >= 0, k = n, n-1, ..., 1, 0.at n=65A098825
• Triangle read by rows: T(n,k) is the number of permutations of [n] having k small descents (n >= 1; 0 <= k <= n-1). A small descent in a permutation (x_1,x_2,...,x_n) is a position i such that x_i - x_(i+1) = 1.at n=46A123513
• 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=53A133643
• 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=53A133644
• Triangle T(n,k) read by rows: T(0,k)=1, otherwise T(n,k)= 1 + floor(n!*exp(-(k-floor(n)/2)^2)).at n=59A171229
• a(n) = ceiling(n!/e) with e = A001113 = exp(1).at n=10A174318
• 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=31A180185
• 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=36A180186
• Triangle read by rows: T(n,k) is the number of permutations of [n] having k fixed blocks.at n=35A180192
• Triangle read by rows: T(n,k) is the number of permutations of [n] that have k isolated entries (0 <= k <= n).at n=63A180196