4996616625
domain: N
Appears in sequences
- Quadruple factorial numbers n!!!!: a(n) = n*a(n-4).at n=33A007662
- Quartic (or 4-fold) factorial numbers: a(n) = Product_{k = 0..n-1} (4*k + 1).at n=9A007696
- Triangle read by rows, the Bell transform of the quartic factorial numbers A007696(n+1) without column 0.at n=36A049029
- 4th-order non-linear ("factorial") recursion: a(0)=a(1)=a(2)=a(3)=1, a(n) = (n+1)*a(n-4).at n=32A081407
- Triangle of numbers obtained from the partition array A134274.at n=36A134275
- Triangle, read by rows, T(n,k) = k^(n+1) * Pochhammer(1/k, n+1).at n=31A153274
- a(n) = (2*n - 1) * a(n-2) for n>1, a(0) = a(1) = 1.at n=17A235136
- Triangle read by rows: T(n, k) is the Sheffer triangle ((1 - 4*x)^(-1/4), (-1/4)*log(1 - 4*x)). A generalized Stirling1 triangle.at n=45A290319
- Number of minimum dominating sets in the n-triangular (Johnson) graph.at n=16A323499
- a(n) = n! / (a(n-1) a(n-2) a(n-3)), where a(0) = a(1) = a(2) = 1.at n=33A372995