3047466240
domain: N
Appears in sequences
- a(n) is the number of digraphs (not allowing loops) with vertices 1,2,...,n that have a unique Eulerian tour (up to cyclic shift).at n=8A102693
- Product of 8 consecutive integers. a(n) = RisingFactorial(n, 8).at n=12A239035
- Number of permutations of [n] beginning with at least ceiling(n/2) ascents.at n=19A262034
- a(n) = Product_{k=0..2*n-1} (3*n+k).at n=4A384302