1144066

Appears in sequences

• a(n) = binomial coefficient C(n,10).at n=13A001287
• Binomial coefficient C(2n+1, n-1).at n=10A002054
• Triangulations of the disk G_{2,n}.at n=10A005498
• 12-dimensional centered tetrahedral numbers.at n=10A008506
• Binomial coefficient C(23,n).at n=10A010939
• Binomial coefficient C(23,n).at n=13A010939
• a(n) = binomial(n,13).at n=10A010966
• Binomial coefficients: C(n,k), 9 <= k <= n-9, sorted.at n=17A024753
• Binomial coefficients: C(n,k), 9 <= k <= n-9, sorted.at n=18A024753
• Binomial coefficients: C(n,k), 10 <= k <= n-10, sorted.at n=6A024754
• Binomial coefficients: C(n,k), 10 <= k <= n-10, sorted.at n=7A024754
• Binomial coefficients: C(n,k), 8 <= k <= n-8, sorted, duplicates removed.at n=20A024760
• Binomial coefficients: C(n,k), 9 <= k <= n-9, sorted, duplicates removed.at n=10A024761
• Binomial coefficients: C(n,k), 10 <= k <= n-10, sorted, duplicates removed.at n=4A024762
• a(n) = binomial(n, floor((n-3)/2)).at n=23A037951
• a(n) = binomial(n, floor(n/2)-1).at n=23A037955
• a(n) = LCM(binomial(n,0), ..., binomial(n,n)) / binomial(n,floor(n/2)).at n=46A048619
• T(2n+3,n), array T as in A050186; a count of aperiodic binary words.at n=10A051196
• a(n) = lcm{1, ..., 2n} / binomial(2n, n).at n=23A068550
• Triangle of C(n+1,k)*C(2*n-3*k,n-3*k)/(n+1) by rows.at n=36A073187