49742

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=10A003441
• a(n) = floor( binomial(n,9)/10 ).at n=22A011846
• Number of aperiodic necklaces of n beads of 2 colors, 10 of them black.at n=12A032168
• Number of necklaces with 10 black beads and n-10 white beads.at n=13A032195
• T(n,n-1), array T as in A047040; T(n-1,n), array T given by A047050.at n=10A047043
• T(n,n-2), array T as in A047040; T(n-2,n), array T given by A047050.at n=10A047044
• T(n,n-3), array T as in A047040; T(n-3,n), array T given by A047050.at n=10A047045
• a(n) = LCM(binomial(n,0), ..., binomial(n,n)) / binomial(n,floor(n/2)).at n=45A048619
• T(2n+3, n), array T as in A051168; a count of Lyndon words.at n=10A050181
• a(n) = lcm(1,2,...,2*n) / (n*binomial(2*n, n)).at n=22A068553
• Numbers k such that both k and 2*k are balanced numbers (A020492).at n=30A076375
• Numbers n such that sigma(n) = 6*phi(n).at n=12A104900
• Number of admissible sequences of order j; related to 5x+1 problem.at n=9A174795
• a(n) = binomial(6*n + 5, 3*n + 1)/(6*n + 5).at n=3A265101
• Squarefree primitive abundant numbers (first definition: having only deficient proper divisors).at n=36A298973
• 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=24A306444
• The primitive abundant numbers k (A071395) arranged by the decreasing values of their abundancy index sigma(k)/k.at n=13A307098
• a(n) = product of those prime(k) such that floor(n/prime(k)) is even.at n=44A372007