32256000

Appears in sequences

• a(n) is the number of solutions to the congruence Sum_{k=1..n} x_k == 1 (mod 2n), where x_k are distinct elements of the set {0, 1, ..., 2n}, k = 1..n.at n=7A174663
• A(m, n) = lcm_{p in Partitions(n)} (Product_{r in p}(r + m)). Array read by ascending antidiagonals, for m, n >= 0.at n=51A368116