3991995

Appears in sequences

• Number of bond-rooted polyenoids with n edges.at n=13A000913
• Number of dissections of a polygon.at n=12A003444
• Number of triangulated (n+2)-gons rooted at an exterior edge.at n=13A006078
• T(n,n-2), array T as in A047040; T(n-2,n), array T given by A047050.at n=13A047044
• T(n,n-3), array T as in A047040; T(n-3,n), array T given by A047050.at n=13A047045
• a(n) = T(2*n+4, n), array T as in A051168 (a count of Lyndon words).at n=13A050182
• Number of admissible sequences of order j; related to 5x+1 problem.at n=12A174795
• Number of nonequivalent dissections of an n-gon into n-3 polygons by nonintersecting diagonals up to rotation.at n=13A220881
• a(n) = binomial(8*n + 6, 4*n + 1)/(8*n + 6).at n=3A265102
• 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=32A306444