319770
domain: N
Appears in sequences
- a(n) = binomial coefficient C(n,8).at n=14A000581
- Binomial coefficients C(2n,n-3).at n=8A002696
- From paths in the plane.at n=7A006859
- Binomial coefficient C(22,n).at n=8A010938
- Binomial coefficient C(22,n).at n=14A010938
- a(n) = binomial coefficient C(n,14).at n=8A010967
- Number of compositions of n into 9 ordered relatively prime parts.at n=14A023034
- Binomial coefficients: C(n,k), 8 <= k <= n-8, sorted.at n=19A024752
- Binomial coefficients: C(n,k), 8 <= k <= n-8, sorted.at n=20A024752
- Binomial coefficients: C(n,k), 7 <= k <= n-7, sorted, duplicates removed.at n=21A024759
- Binomial coefficients: C(n,k), 8 <= k <= n-8, sorted, duplicates removed.at n=11A024760
- Number of symmetric types of (4,2n)-hypergraphs under action of complementing group C(4,2).at n=15A029941
- Number of combinations of n objects taken pi(n) at a time.at n=22A037031
- a(n) = binomial(n, floor((n-5)/2)).at n=22A037953
- a(n) = binomial(n, floor((n-6)/2)).at n=22A037957
- Binomial coefficients C(2*n+8,8).at n=7A053137
- a(n) = max{ C(n,0), C(n-1,1), C(n-2,2), ..., C(n-n,n) }.at n=30A073028
- Staircase on Pascal's triangle.at n=14A081181
- Row sums of triangle A099575.at n=14A099576
- a(n) = 2^n mod reverse(2^n).at n=22A103167