30656102400
domain: N
Appears in sequences
- a(0) = 1; for n > 0, a(n) = (prime(n)-1)*a(n-1).at n=11A005867
- Conflicts during insertions into exchange trees on n nodes.at n=13A007905
- a(n) = 2^n*(2*n)!.at n=6A065140
- Denominators of a Taylor series expansion of 1/sqrt(cosh(x)) (even powers only).at n=6A190196
- a(0)=1; thereafter a(n) = n*a(n-1) if n is even, otherwise a(n) = 2*n*a(n-1).at n=12A232205
- Number of n X 2 arrays containing 2 copies of 0..n-1 with row sums equal.at n=12A268363
- A variant of payphone permutations: given a circular booth with n payphones, one of which is already occupied, a(n) is the number ways for n-1 people to choose the payphones in order, where each person chooses an unoccupied payphone such that the closest occupied payphone is as distant as possible.at n=18A362192
- The n-volume of the unit regular n-simplex is sqrt(A364900(n))/a(n), with A364900(n) being squarefree.at n=12A364901