133496

Appears in sequences

• Subfactorial or rencontres numbers, or derangements: number of permutations of n elements with no fixed points.at n=9A000166
• Triangle T(n,k) of rencontres numbers (number of permutations of n elements with k fixed points).at n=45A008290
• Triangle of rencontres numbers.at n=28A008291
• Triangle read by rows: T(n,k) = number of permutations of [n] allowing i->i+j (mod n), j=0..k-1.at n=43A008305
• 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=43A010027
• a(n) = floor( n! / e ).at n=8A014508
• 9th differences of factorial numbers.at n=0A023046
• Triangle of numbers of permutations eliminating just k cards out of n in game of Mousetrap.at n=45A028305
• Triangle read by rows of numbers of permutations eliminating just card k out of n in game of Mousetrap.at n=45A028306
• Triangular array formed from successive differences of factorial numbers, then with factorials removed.at n=54A060475
• Euler's difference table: triangle read by rows, formed by starting with factorial numbers (A000142) and repeatedly taking differences. T(n,n) = n!, T(n,k) = T(n,k+1) - T(n-1,k).at n=45A068106
• Table T(n,k) giving number of ways of obtaining exactly 0 correct answers on an (n,k)-matching problem (1 <= k <= n).at n=44A076731
• 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=43A076732
• Triangle T(n, k), read by row, related to Euler's difference table A068106 (divide column k of A068106 by k!).at n=45A086764
• Transposed version of A080955: T(n,k) = A080955(k,n), n>=0, k>=-1.at n=54A089258
• Triangle read by rows giving coefficients of polynomials arising in successive differences of (n!)_{n>=0}.at n=54A094791
• 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=54A098825
• Triangle T(n,k), the number of permutations on n elements that have no cycles of length k.at n=36A122974
• 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=37A123513
• 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=43A133643