817190
domain: N
Appears in sequences
- a(n) = binomial coefficient C(n,9).at n=14A000582
- Binomial coefficients C(2n+1, n-2).at n=9A003516
- Expansion of Product_{k>=1} (1 - x^k)^23.at n=14A010829
- Binomial coefficient C(23,n).at n=9A010939
- Binomial coefficient C(23,n).at n=14A010939
- a(n) = binomial coefficient C(n,14).at n=9A010967
- Binomial coefficients: C(n,k), 9 <= k <= n-9, sorted.at n=15A024753
- Binomial coefficients: C(n,k), 9 <= k <= n-9, sorted.at n=16A024753
- Binomial coefficients: C(n,k), 7 <= k <= n-7, sorted, duplicates removed.at n=31A024759
- Binomial coefficients: C(n,k), 8 <= k <= n-8, sorted, duplicates removed.at n=18A024760
- Binomial coefficients: C(n,k), 9 <= k <= n-9, sorted, duplicates removed.at n=9A024761
- Number of combinations of n objects taken pi(n) at a time.at n=23A037031
- a(n) = binomial(n, floor((n-5)/2)).at n=23A037953
- a(n) = binomial(n, floor((n-4)/2)).at n=23A037956
- Maximum over k of the largest squarefree number dividing a value of binomial(n,k).at n=24A048681
- T(2n+5,n), array T as in A050186; a count of aperiodic binary words.at n=9A051198
- Binomial coefficients C(2*n+9,9).at n=7A053138
- a(n) = binomial(prime(n), n) where prime(n) = n-th prime.at n=8A060604
- a(n) = max{ C(n,0), C(n-1,1), C(n-2,2), ..., C(n-n,n) }.at n=32A073028
- Staircase on Pascal's triangle.at n=14A081205