65169

Appears in sequences

• Number of nonequivalent dissections of a polygon into n quadrilaterals by nonintersecting diagonals up to rotation.at n=10A005034
• a(n) = smallest number k > a(n-1) maximizing the number of primes in all sums a(j)+k, j=1..(n-1), with a(1)=2.at n=15A291163
• Array read by antidiagonals: T(n,k) = number of nonequivalent dissections of a polygon into n k-gons by nonintersecting diagonals up to rotation (k >= 3).at n=64A295224
• Number of nonequivalent noncrossing trees with n edges up to rotation and reflection.at n=10A296533
• Traces of the matrices (A345197) counting integer compositions by length and alternating sum.at n=20A345908