17383860

Appears in sequences

• Binomial coefficient C(2n+1, n-1).at n=12A002054
• Triangulations of the disk G_{2,n}.at n=12A005498
• Binomial coefficient C(27,n).at n=12A010943
• Binomial coefficient C(27,n).at n=15A010943
• a(n) = binomial(n,12).at n=15A010965
• a(n) = binomial(n,15).at n=12A010968
• Binomial coefficients: C(n,k), 10 <= k <= n-10, sorted, duplicates removed.at n=19A024762
• a(n) = binomial(n, floor((n-3)/2)).at n=27A037951
• a(n) = binomial(n, floor(n/2)-1).at n=27A037955
• a(n) = binomial(a,b) where a>=b and one of a and b is the product of the nonzero decimal digits of n and the other is the sum of the decimal digits of n.at n=39A067453
• Expansion of e.g.f. Bessel_I(2,2x) + 2*Bessel_I(3,2x) + Bessel_I(4,2x).at n=26A116385
• Expansion of e.g.f. Bessel_I(2,2x) + Bessel_I(3,2x) + Bessel_I(4,2x).at n=26A116400
• Expansion of e.g.f. Bessel_I(2,2x) + Bessel_I(3,2x) + Bessel_I(4,2x).at n=27A116400
• Triangle read by rows: binomial(3*n,3*k), 0 <= k <= n.at n=49A139459
• Triangle read by rows: binomial(3*n,3*k), 0 <= k <= n.at n=50A139459
• Triangle read by rows, T(n, k) = binomial(3*(prime(n+1) - 1)/2, 3*(prime(k+1) - 1)/2) with T(n,0) = 1.at n=32A154652
• Largest element of n-th row of Pascal's triangle that is not a multiple of n.at n=25A180733
• 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=29A191529
• Triangle: T(n,k)=C(4n-1,2k), 0<=k<=n.at n=34A193632
• Row sums of the triangle of generalized ballot numbers A238762.at n=25A238879