11022480

Appears in sequences

• 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=21A007661
• Triple factorial numbers: (3n)!!! = 3^n*n!.at n=7A032031
• Table T(n,k) = n!*k^n, read by upwards antidiagonals.at n=58A131182
• 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=47A136212
• Triple factorials n!!!: a(n) = n*a(n-3).at n=21A161474
• Bell polynomial B(n,k){3,6,6,0,...,0}.at n=41A187082
• Triangular array read by rows. T(n,k) is the number of connected endofunctions on {1,2,...,n} that have exactly k nodes in the unique cycle of its digraph representation.at n=40A201685
• Array: row n shows the coefficients of the characteristic polynomial of the n-th principal submatrix of (3i-2 if i=j and = 0 otherwise), as in A204160.at n=35A204161
• Triangle read by rows, k!*S_3(n, k) where S_m(n, k) are the Stirling-Frobenius subset numbers of order m; n >= 0, k >= 0.at n=35A225472
• Number of endofunctions on [n] where the smallest cycle length equals 5.at n=4A246192
• Number of endofunctions on [n] whose cycle lengths are multiples of 5.at n=9A246612
• Coefficients in the series reversion of x*exp(-x^2).at n=4A277168
• Triangle read by rows: T(n, k) = S2[3,1](n, k)*k! with the Sheffer triangle S2[3,1] = (exp(x), exp(3*x) -1) given in A282629.at n=35A284861
• Triangle read by rows, generalized Eulerian polynomials evaluated at x = 1.at n=31A337997