209440

Appears in sequences

• Triangle read by rows: the Bell transform of the triple factorial numbers A008544 without column 0.at n=21A004747
• 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=17A007661
• Triple factorial numbers: Product_{k=0..n-1} (3*k+2).at n=6A008544
• a(n) = n*(n+1)*(n+2)*(n+3)/6.at n=32A033488
• An invertible triangle of ratios of triple factorials.at n=21A112333
• Numbers taking exactly 21 steps to reach 15 in A086793.at n=11A119397
• Numbers k not divisible by 6 such that sigma(k) > 3*k.at n=15A126104
• Left 3-step factorial (n,-3)!: a(n) = (-1)^n * A008544(n).at n=6A133480
• 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=29A136212
• 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=21A136216
• Triangle, read by rows, equal to the matrix 4th power of triangle A136220.at n=40A136232
• Partition number array, called M32(-2), related to A004747(n,m) = |S2(-2;n,m)| (generalized Stirling triangle).at n=29A143172
• 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=29A144274
• 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=45A144274
• Lower triangular array called S2hat(-2) related to partition number array A144274.at n=21A144275
• A partition product of Stirling_2 type [parameter k = 2] with biggest-part statistic (triangle read by rows).at n=27A157402
• 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=27A168295
• 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=21A225470
• 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=21A225477
• Number of n X 4 0..3 arrays x(i,j) with each element horizontally, diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 4 and at least one element with value (x(i,j)-1) mod 4, no adjacent elements equal, and upper left element zero.at n=5A231045