40883535
domain: N
Appears in sequences
- Triangle of numbers related to triangle A049213; generalization of Stirling numbers of second kind A008277, Bessel triangle A001497.at n=28A000369
- Quadruple factorial numbers n!!!!: a(n) = n*a(n-4).at n=27A007662
- Quadruple factorial numbers: Product_{k=0..n-1} (4*k + 3).at n=7A008545
- Partition number array, called M32(-3), related to A000369(n,m) = |S2(-3;n,m)| (generalized Stirling triangle).at n=44A143173
- Partition number array, called M32hat(-3)= 'M32(-3)/M3'= 'A143173/A036040', related to A000369(n,m)= |S2(-3;n,m)| (generalized Stirling triangle).at n=44A144279
- Lower triangular array called S2hat(-3) related to partition number array A144279.at n=28A144280
- A partition product of Stirling_2 type [parameter k = 3] with biggest-part statistic (triangle read by rows).at n=35A157403
- Triangle read by rows, s_4(n, k) where s_m(n, k) are the Stirling-Frobenius cycle numbers of order m; n >= 0, k >= 0.at n=28A225471
- Triangle read by rows, 4^k*s_4(n, k) where s_m(n, k) are the Stirling-Frobenius cycle numbers of order m; n >= 0, k >= 0.at n=28A225478
- a(n) = (2*n - 1) * a(n-2) for n>1, a(0) = a(1) = 1.at n=14A235136
- Table T(n,k) read by upward antidiagonals. T(n,k) = Product_{i=1..n} Sum_{j=1..k} (i-1)*k+j.at n=29A333445