203490
domain: N
Appears in sequences
- a(n) = binomial coefficient C(n,8).at n=13A000581
- Binomial coefficients C(2n+1, n-2).at n=8A003516
- 12-dimensional centered tetrahedral numbers.at n=8A008506
- Binomial coefficient C(21,n).at n=8A010937
- Binomial coefficient C(21,n).at n=13A010937
- a(n) = binomial(n,13).at n=8A010966
- Binomial coefficients: C(n,k), 7 <= k <= n-7, sorted.at n=32A024751
- Binomial coefficients: C(n,k), 8 <= k <= n-8, sorted.at n=15A024752
- Binomial coefficients: C(n,k), 8 <= k <= n-8, sorted.at n=16A024752
- Binomial coefficients: C(n,k), 6 <= k <= n-6, sorted, duplicates removed.at n=32A024758
- Binomial coefficients: C(n,k), 7 <= k <= n-7, sorted, duplicates removed.at n=18A024759
- Binomial coefficients: C(n,k), 8 <= k <= n-8, sorted, duplicates removed.at n=9A024760
- Number of combinations of n objects taken pi(n) at a time.at n=21A037031
- a(n) = binomial(n, floor((n-5)/2)).at n=21A037953
- a(n) = binomial(n, floor((n-4)/2)).at n=21A037956
- a(n) = LCM(binomial(n,0), ..., binomial(n,n)) / binomial(n,floor(n/2)).at n=43A048619
- T(2n+5,n), array T as in A050186; a count of aperiodic binary words.at n=8A051198
- Binomial coefficients C(2*n-7,8).at n=6A053130
- a(n) = binomial(Fibonacci(n), Fibonacci(n-1)).at n=7A066526
- a(n) = lcm(1,2,...,2*n) / (n*binomial(2*n, n)).at n=21A068553