115997970

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=16A003441
• T(2n+3, n), array T as in A051168; a count of Lyndon words.at n=16A050181
• a(n) = binomial(6*n + 5, 3*n + 1)/(6*n + 5).at n=5A265101
• 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=39A306444
• Number of n element multisets of length 4 vectors over GF(2) that sum to zero.at n=19A363350