67863915

Appears in sequences

• Binomial coefficient C(2n+1, n-1).at n=13A002054
• Binomial coefficient C(29,n).at n=13A010945
• Binomial coefficient C(29,n).at n=16A010945
• a(n) = binomial(n,13).at n=16A010966
• a(n) = binomial(n,16).at n=13A010969
• a(n) = greatest residue of S(n,m) mod C(n-1,m-1), for m = 1,2,...,n; S(n,m) are Stirling numbers of second kind.at n=30A024424
• a(n) = binomial(n, floor((n-3)/2)).at n=29A037951
• a(n) = binomial(n, floor(n/2)-1).at n=29A037955
• T(2n+3,n), array T as in A050186; a count of aperiodic binary words.at n=13A051196
• Expansion of e.g.f. Bessel_I(2,2x) + 2*Bessel_I(3,2x) + Bessel_I(4,2x).at n=28A116385
• Expansion of e.g.f. Bessel_I(2,2x) + Bessel_I(3,2x) + Bessel_I(4,2x).at n=28A116400
• Expansion of e.g.f. Bessel_I(2,2x) + Bessel_I(3,2x) + Bessel_I(4,2x).at n=29A116400
• 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=31A191529
• Row sums of the triangle of generalized ballot numbers A238762.at n=27A238879
• a(n) = binomial( prime(n+4), prime(n) ).at n=5A250092
• a(n) = binomial(n, 2^floor(log_2(n))).at n=28A291665
• a(n) = binomial(n,k(n)), where k(2) = 1, k(n) = k(n-1) + (a(n-1) mod 2).at n=27A375972