297160

Appears in sequences

• Number of bond-rooted polyenoids with n edges.at n=11A000913
• Number of dissections of a polygon.at n=10A003444
• Number of triangulated (n+2)-gons rooted at an exterior edge.at n=11A006078
• Super ballot numbers: 6(2n)!/(n!(n+2)!).at n=13A007054
• Number of aperiodic necklaces of n beads of 2 colors, 11 of them black.at n=14A032169
• Number of necklaces with 11 black beads and n-11 white beads.at n=15A032196
• a(n) is the difference between maximal and central squarefree kernel numbers dividing values of {binomial(n,k)} or A001405(n), respectively.at n=24A048682
• a(n) = T(2*n+4, n), array T as in A051168 (a count of Lyndon words).at n=11A050182
• a(n) = 6*(2n-4)!/((n-2)!n!), if n>2. a(0) = 1, a(1) = a(2) = 2.at n=15A091712
• a(n) = A184879(2*n, n) - A184879(2*n, n+1) where A184879(n, k) = Hypergeometric2F1(-2*k, 2*k-2*n, 1, -1) if 0<=k<=n.at n=14A184881
• Number of nonequivalent dissections of an n-gon into n-3 polygons by nonintersecting diagonals up to rotation.at n=11A220881
• Apply partial sum operator 5 times to primes.at n=18A254784
• a(n) is the number of 2n-regular circulant graphs of order 53.at n=11A367554
• a(n) is the number of 2n-regular circulant graphs of order 53.at n=15A367554