670442572800
domain: N
Appears in sequences
- Quadruple factorial numbers: a(n) = (2n)!/n!.at n=10A001813
- a(n) = (4*n)!/(2*n)!.at n=5A009120
- Number of permutations p of {1,2,3...,n} that are fixed points under the operation of first reversing p, then taking the inverse.at n=39A037224
- Number of permutations p of {1,2,3...,n} that are fixed points under the operation of first reversing p, then taking the inverse.at n=40A037224
- a(n) = (n+10)!/10!.at n=10A051431
- Hermite numbers.at n=20A067994
- a(n) = n! / floor(n/2)!.at n=20A081125
- a(n) is n! times the coefficient of Pi^floor(n/2) in the volume of an n-dimensional unit ball.at n=20A094941
- Least product n*(n-1)*(n-2)*...*(n-k+1) divisible by (n-k)!.at n=19A096123
- 2n-th derivative of the Gaussian exp(-x^2) evaluated at x=0.at n=10A097388
- Smallest constant of a multiplicative bimagic square of order n.at n=5A111155
- Smallest magic product for an n X n multiplicative magic square.at n=5A114060
- Bi-diagonal inverse of [k<=n]*n!/(2k)!.at n=65A119836
- If n mod 4 = 2 or n mod 4 = 3 then a(n) = 0 else let m=floor(n/4), then a(n) = (2*m)!/m!.at n=40A122670
- If n mod 4 = 2 or n mod 4 = 3 then a(n) = 0 else let m=floor(n/4), then a(n) = (2*m)!/m!.at n=41A122670
- Define an array by Q(m, 0) = 1, Q(m, 1) = 1; Q(m, 2k) = (m - 2k + 1)*Q(m+1, 2k-1) - (2k-1)*Q(m+2, 2k-2), m*Q(m, 2k+1) = (m - 2k)*Q(m+1, 2k) - 2k(m+1)*Q(m+2, 2k-1). Sequence gives Q(0,n).at n=20A127137
- Sequence defined by a(2*n) = 2*(n^2 + 2*n) and a(2*n-1) = (2*n)!/n!.at n=19A154030
- a(n) = n!/ceiling(n/2)!.at n=20A205825
- Triangle of derivatives of the Niven polynomials evaluated at 0.at n=65A303986