130922

Appears in sequences

• Number of partial permutations of an n-set; number of n X n binary matrices with at most one 1 in each row and column.at n=7A002720
• Denominators of continued fraction for alternating factorial.at n=14A056953
• Binomial transform of sinh(x)*cosh(sqrt(3)*x).at n=10A084156
• Lower triangular matrix, read by rows: T(i,j) = number of ways i seats can be occupied by any number k (0<=k<=j<=i) of persons.at n=27A086885
• Triangle of certain generalized Bell numbers.at n=42A090210
• Triangle read by rows: Sum_{j=0..k} binomial(n, j)*binomial(k, j)*j!.at n=35A176120
• Number of ways to place k non-attacking bishops on an n x n toroidal chessboard, summed over all k >= 0.at n=6A215943
• 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.at n=35A261763
• Triangle read by rows: T(n,k) = number of n X n (0,1) matrices with at most k 1's in each row or column.at n=21A283500
• Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 517", based on the 5-celled von Neumann neighborhood.at n=16A288831
• A(n,k) = n! * Laguerre(n,-k); square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=43A289192
• Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of e.g.f. exp(x/(1-x))/(1-x)^k.at n=43A293985
• Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where T(n,k) = Sum_{j=0..n} k^j * j! * binomial(n,j)^2.at n=43A341014
• Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where T(n,k) = Sum_{j=0..n} j^k * (n-j)! * binomial(n,j)^2.at n=35A341200
• T(n, k) = (n - k)! * [x^(n-k)] exp(k*x/(1 - x))/(1 - x). Triangle read by rows, T(n, k) for 0 <= k <= n.at n=37A343847
• T(n, k) = n! * [x^n] exp(k * x/(1 - x))/(1 - x). Triangle read by rows, T(n, k) for 0 <= k <= n.at n=29A344048
• Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = n! * Sum_{j=0..n} binomial(n+(k-1)*j,k*j)/j!.at n=43A361600
• Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = n! * Sum_{j=0..n} binomial(n+(k-1)*(j+1),n-j)/j!.at n=43A361616