151412625
domain: N
Appears in sequences
- Quadruple factorial numbers n!!!!: a(n) = n*a(n-4).at n=29A007662
- Quartic (or 4-fold) factorial numbers: a(n) = Product_{k = 0..n-1} (4*k + 1).at n=8A007696
- Triangle read by rows, the Bell transform of the quartic factorial numbers A007696(n+1) without column 0.at n=28A049029
- 4th-order non-linear ("factorial") recursion: a(0)=a(1)=a(2)=a(3)=1, a(n) = (n+1)*a(n-4).at n=28A081407
- A certain partition array in Abramowitz-Stegun order (A-St order), called M_3(5)/M_3.at n=44A134274
- Triangle of numbers obtained from the partition array A134274.at n=28A134275
- Triangle, read by rows, T(n,k) = k^(n+1) * Pochhammer(1/k, n+1).at n=24A153274
- Triangle S(n,k) by rows: coefficients of 4^((n-1)/2)*(x^(1/4)*d/dx)^n when n=1,3,5,...at n=28A223527
- Triangle S(n,k) by rows: coefficients of 4^(n/2)*(x^(3/4)*d/dx)^n when n=0,2,4,6,...at n=36A223528
- a(n) = (2*n - 1) * a(n-2) for n>1, a(0) = a(1) = 1.at n=15A235136
- Triangle read by rows: The Bell transform of the quartic factorial numbers (A007696).at n=46A265606
- 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=36A290319
- A(n, k) = 4^n*Pochhammer(k/4, n). Square array read by ascending antidiagonals.at n=46A370915
- Triangle read by rows: T(n, k) = 4^n*Sum_{j=0..k} (-1)^(k - j)*binomial(k, j)* Pochhammer(j/4, n).at n=37A371026
- a(n) = n! / (a(n-1) a(n-2) a(n-3)), where a(0) = a(1) = a(2) = 1.at n=29A372995