23592960
domain: N
Appears in sequences
- a(n) = 2^(n*(n-1)/2)*n!.at n=6A011266
- One eighth of octo-factorial numbers.at n=5A034976
- Triangle giving a(n,k) = number of k-colored labeled graphs with n nodes.at n=20A046860
- a(n) = Product_{i=2..n} phi(i)/bigomega(i).at n=15A066988
- Treated as strings, the concatenation c of the prime factors of n, in increasing order, is an initial segment of n. Equivalently, n begins with c.at n=30A069154
- Number of subsets of {1,.., n} containing exactly two primes.at n=28A089822
- Number of subsets of {1,.., n} containing no twin prime pairs.at n=25A089827
- Row sums of triangle A094280.at n=22A094283
- a(n) = 4^n * n*(n+1).at n=9A116144
- A triangle of coefficients of a product polynomial sequence based on Chebyshev T:differentiation of T[(x,n) which gives U(x,n): p(x,n) = Product_{m=0..n} Sum_{i=0..m} (d/dx) T(x,i+1).at n=40A139809
- a(n) = 2^n * (n + 3)!!.at n=9A155160
- A double binomial sum involving absolute values.at n=5A268148
- a(n) = Product_{d|n} d*tau(d), where tau(k) = the number of the divisors of k (A000005).at n=31A306705
- Number of (undirected) Hamiltonian paths in the 2n-crossed prism graph.at n=13A308136