2340135

Appears in sequences

• Number of nonequivalent dissections of a polygon into n triangles by nonintersecting diagonals rooted at a cell up to rotation.at n=13A003441
• T(2n+3, n), array T as in A051168; a count of Lyndon words.at n=13A050181
• Divide n! repeatedly by i! for i from floor(n/2) down through 2; a(n) = remaining quotient.at n=27A111866
• a(n) = binomial(6*n + 5, 3*n + 1)/(6*n + 5).at n=4A265101
• A(n,k) = binomial((2*k+1)*n+2, k*n+1)/((2*k+1)*n+2), square array A(n,k) read by antidiagonals, for n >= 0, k >= 0.at n=31A306444
• Number of n element multisets of length 4 vectors over GF(2) that sum to zero.at n=13A363350
• a(n) = Product_{k=0..n-1} (3*n+2*k).at n=5A384165
• E.g.f. A(x) satisfies A(x) = exp( arcsinh(x * A(x)^3) ).at n=6A385441