1037158320

Appears in sequences

• Binomial coefficient C(2n+1, n-1).at n=15A002054
• a(1)=1; for n >= 1, a(n+1) = lcm(a(n),n) / gcd(a(n),n).at n=34A008339
• Binomial coefficient C(33,n).at n=15A010949
• Binomial coefficient C(33,n).at n=18A010949
• a(n) = binomial(n,15).at n=18A010968
• a(n) = binomial(n,18).at n=15A010971
• a(n) = binomial(n, floor(n/2)-1).at n=33A037955
• a(1) = 1, a(n) = lcm(n, a(n-1)) / gcd(n, a(n-1)).at n=33A077139
• Expansion of e.g.f. Bessel_I(2,2x) + 2*Bessel_I(3,2x) + Bessel_I(4,2x).at n=32A116385
• Expansion of e.g.f. Bessel_I(2,2x) + Bessel_I(3,2x) + Bessel_I(4,2x).at n=32A116400
• Expansion of e.g.f. Bessel_I(2,2x) + Bessel_I(3,2x) + Bessel_I(4,2x).at n=33A116400
• 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=40A154652
• 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=41A154652
• 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=35A191529
• Row sums of the triangle of generalized ballot numbers A238762.at n=31A238879
• Terms at square positions in Pascal's triangle when in flattened form.at n=24A268295
• T(n, k) = [x^k] hypergeom([-2^n/2, -2^n/2 - 1/2], [1/2], x). Triangle read by rows, T(n, k) for n >= 0.at n=30A340554
• A260850 sorted into increasing order and duplicates omitted.at n=31A370974