4457400

Appears in sequences

• a(n) = binomial(n,11).at n=14A001288
• Binomial coefficient C(2n+1, n-1).at n=11A002054
• Binomial coefficient C(25,n).at n=11A010941
• Binomial coefficient C(25,n).at n=14A010941
• a(n) = binomial coefficient C(n,14).at n=11A010967
• Binomial coefficients: C(n,k), 10 <= k <= n-10, sorted.at n=17A024754
• Binomial coefficients: C(n,k), 10 <= k <= n-10, sorted.at n=18A024754
• Binomial coefficients: C(n,k), 9 <= k <= n-9, sorted, duplicates removed.at n=19A024761
• Binomial coefficients: C(n,k), 10 <= k <= n-10, sorted, duplicates removed.at n=10A024762
• a(n) = binomial(n, floor((n-3)/2)).at n=25A037951
• a(n) = binomial(n, floor(n/2)-1).at n=25A037955
• T(2n+3,n), array T as in A050186; a count of aperiodic binary words.at n=11A051196
• Triangle of C(n+1,k)*C(2*n-3*k,n-3*k)/(n+1) by rows.at n=41A073187
• First differences of coefficients of g.f. (1-x)^24.at n=13A078488
• Expansion of e.g.f. Bessel_I(2,2x) + 2*Bessel_I(3,2x) + Bessel_I(4,2x).at n=24A116385
• Expansion of e.g.f. Bessel_I(2,2x) + Bessel_I(3,2x) + Bessel_I(4,2x).at n=24A116400
• Expansion of e.g.f. Bessel_I(2,2x) + Bessel_I(3,2x) + Bessel_I(4,2x).at n=25A116400
• Number of dispersed Dyck paths of length n (i.e., Motzkin paths of length n with no (1,0) steps at positive heights) with no initial and no final (1,0)-steps.at n=27A191529
• Irregular triangle read by rows: T(n,k) is the number of labeled relations on n nodes with exactly k edges; n>=0, 0<=k<=n^2.at n=46A217285
• Irregular triangle read by rows: T(n,k) is the number of labeled relations on n nodes with exactly k edges; n>=0, 0<=k<=n^2.at n=49A217285