4188800

Appears in sequences

• Triangle read by rows: the Bell transform of the triple factorial numbers A008544 without column 0.at n=28A004747
• 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=20A007661
• Triple factorial numbers: Product_{k=0..n-1} (3*k+2).at n=7A008544
• An invertible triangle of ratios of triple factorials.at n=28A112333
• 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=37A136212
• 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=28A136216
• Partition number array, called M32(-2), related to A004747(n,m) = |S2(-2;n,m)| (generalized Stirling triangle).at n=44A143172
• Partition number array, called M32hat(-2)= 'M32(-2)/M3'= 'A143172/A036040', related to A004747(n,m)= |S2(-2;n,m)| (generalized Stirling triangle).at n=44A144274
• Lower triangular array called S2hat(-2) related to partition number array A144274.at n=28A144275
• A partition product of Stirling_2 type [parameter k = 2] with biggest-part statistic (triangle read by rows).at n=35A157402
• 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=35A168295
• 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=28A225470
• 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=28A225477
• Triangle read by rows. A generalization of unsigned Lah numbers, called L[3,1].at n=28A290596
• Array read by ascending antidiagonals, A(n, k) = -(-n)^k*FallingFactorial(1/n, k) for n, k >= 1.at n=52A349971
• Square array read by ascending antidiagonals: A(n, k) = 3^n*Pochhammer(k/3, n).at n=47A371077