33649
domain: N
Appears in sequences
- Binomial coefficients C(n,5).at n=23A000389
- Binomial coefficients C(2*n+5,5).at n=9A002299
- From generalized Catalan numbers.at n=6A006630
- Binomial coefficient C(23,n).at n=5A010939
- Binomial coefficient C(23,n).at n=18A010939
- a(n) = binomial(n,18).at n=5A010971
- Triangular array formed from odd elements to right of middle of rows of Pascal's triangle.at n=61A014475
- Binomial coefficients: C(n,k), 5 <= k <= n-5, sorted, duplicates removed.at n=27A024757
- a(n) = binomial(2*n+1, n-6).at n=5A030056
- T(n,5), array T as in A050186; a count of aperiodic binary words.at n=18A050190
- a(n) = binomial(n, floor(n/4)).at n=23A051036
- a(n) = binomial(n, round(sqrt(n))).at n=23A055789
- Triangle, read by antidiagonals, where T(n,k) = C(n+n*k+k, n*k+k).at n=39A060543
- Triangle read by rows: T(n,k) = binomial(3n+3, k)*(n-k+1)/(n+1).at n=34A064282
- Numerator of Sum_{k=0..n} 2^(k-2*n) * binomial(2*n-2*k,n-k) * binomial(n+k,n).at n=6A067002
- a(n) = lcm(n, n+1, n+2, n+3, n+4) / 60.at n=18A067048
- Triangle read by rows of numbers of paths in a lattice satisfying certain conditions.at n=42A071948
- Triangle read by rows: T(n,k) is the number of noncrossing trees with root degree equal to k.at n=38A092276
- Central column of triangle A102427.at n=9A102428
- Triangle, read by rows, where T(n,k) = binomial(n*(n-1)/2 - k*(k-1)/2 + n-k+3, n-k).at n=22A107873