987840

Appears in sequences

• Triangle read by rows: the Bell transform of the triple factorial numbers A008544 without column 0.at n=30A004747
• Erroneous version of A342587.at n=34A008285
• Triangle read by rows, the Bell transform of the triple factorial numbers A007559(n+1) without column 0.at n=22A035469
• Triangle read by rows: T(n,k) = k!*binomial(n-1,k-1)*Stirling2(n,k), 1 <= k <= n.at n=34A048743
• Number of labeled order relations on n nodes in which longest chain has n-1 nodes.at n=6A055533
• Triangle T(n,k), n >= 2, n+1 <= k <= 2*n-1, number of permutations p of 1,...,n, with max(p(i)+p(i-1), i=2..n) = k.at n=42A064484
• Triangular array of coefficients multiplied by n! of polynomials in e. These give the expected number of trials needed for the sum of uniform random variables from the interval [0,1] to exceed n+1.at n=38A089087
• Third column (m=3) of triangle S2p(-2) = A004747.at n=5A144346
• Array read by antidiagonals: A(n,k) = (k+1)^n*(n+k)!/n!.at n=42A152818
• Triangle T(n, k) = A176013(n, k) + A176013(n, n-k+1), read by rows.at n=31A176022
• Triangle T(n, k) = A176013(n, k) + A176013(n, n-k+1), read by rows.at n=32A176022
• Irregular triangle T(n,k) = binomial(n-1,m-1)*m!*A036040(n,k), where m=A036043(n,k), read by rows, 1 <= k <= A000041(n).at n=64A181417
• Triangle, read by rows, where T(n,k) = k!*C(n, k)*7^(n-k) for n>=0, k=0..n.at n=42A218017
• Triangle, read by rows: T(n,k) is the number of labeled order relations on n nodes in which the longest chain has k nodes (n>=1, 1<=k<=n).at n=34A342587
• Triangle read by rows: T(n,k) = n!*(n-1)^k/k!.at n=38A350297
• Triangle read by rows: BellMatrix(Product_{p in P(n)} p), where P(n) = {k : k mod m = 1 and 1 <= k <= m*(n + 1)} and m = 3.at n=30A371080