142506
domain: N
Appears in sequences
- Binomial coefficients C(n,5).at n=30A000389
- a(n) = binomial coefficient C(2n, n-10).at n=5A004316
- Binomial coefficient C(3n,n-5).at n=5A004323
- Binomial coefficient C(5n,n-1).at n=5A004343
- Binomial coefficient C(6n,n).at n=5A004355
- Binomial coefficient C(30,n).at n=5A010946
- Binomial coefficient C(30,n).at n=25A010946
- a(n) = binomial(n,25).at n=5A010978
- Number of compositions of n into 6 ordered relatively prime parts.at n=25A023031
- a(n) = n*(n+1)*(n+2)*(n+3)/4.at n=26A033487
- a(n) = binomial(n, floor(n/6)).at n=30A051053
- Denominators of row 4 of table described in A051714/A051715.at n=24A051723
- Binomial coefficients C(2*n-4,5).at n=12A053127
- a(n) = binomial(n, round(sqrt(n))).at n=30A055789
- a(n) = Fibonacci(n)*(Fibonacci(n) + 1).at n=14A059727
- Table by antidiagonals of number of ways of choosing k items from n*k.at n=50A060539
- a(n) = binomial(n, greatest prime factor of n).at n=29A080213
- Number of subsets of {1,2,...,n} in which exactly half of the elements are less than or equal to sqrt(n).at n=30A102366
- Triangle, read by rows, where T(n,k) = C(n*(n-1)/2 - k*(k-1)/2 + n-k, n-k).at n=39A107862
- Triangle read by rows: T(n,k) = number of labeled loopless digraphs with n nodes and k arcs (n >= 1, 0 <= k <= n*(n-1)).at n=50A123554