96342400

Appears in sequences

• Triangle read by rows: the Bell transform of the triple factorial numbers A008544 without column 0.at n=36A004747
• Triple factorial numbers a(n) = n!!!, defined by a(n) = n*a(n-3), a(0) = a(1) = 1, a(2) = 2. Sometimes written n!3.at n=23A007661
• Triple factorial numbers: Product_{k=0..n-1} (3*k+2).at n=8A008544
• An invertible triangle of ratios of triple factorials.at n=36A112333
• Left 3-step factorial (n,-3)!: a(n) = (-1)^n * A008544(n).at n=8A133480
• Triple factorial array, read by antidiagonals, where row n+1 is generated from row n by first removing terms in row n at positions {[m*(m+5)/6], m >= 0} and then taking partial sums, starting with all 1's in row 0.at n=46A136212
• Triangle T, read by rows, where T(n,k) = A008544(n-k)*C(n,k) where A008544 equals the triple factorials in column 0.at n=36A136216
• Lower triangular array called S2hat(-2) related to partition number array A144274.at n=36A144275
• Triangle T(n, k) = coefficients of (p(x,n)), where p(x, n) = (n-1)! * Sum_{j=1..n} A142458(n, j)*binomial(x+j-1, n-1), read by rows.at n=44A168295
• a(n) = Product_{k in M_n} k, M_n = {k | 1 <= k <= 3n and k mod 3 = n mod 3}.at n=8A190903
• Triangle read by rows, s_3(n, k) where s_m(n, k) are the Stirling-Frobenius cycle numbers of order m; n >= 0, k >= 0.at n=36A225470
• Triangle read by rows, 3^k*s_3(n, k) where s_m(n, k) are the Stirling-Frobenius cycle numbers of order m; n >= 0, k >= 0.at n=36A225477
• Triangle read by rows. A generalization of unsigned Lah numbers, called L[3,1].at n=36A290596