1947792
domain: N
Appears in sequences
- Figurate numbers or binomial coefficients C(n,6).at n=36A000579
- Binomial coefficient C(2n,n-12).at n=6A004318
- Binomial coefficient C(3n,n-6).at n=6A004324
- Binomial coefficient C(4n,n-3).at n=6A004333
- Binomial coefficient C(6n,n).at n=6A004355
- Binomial coefficient C(36,n).at n=6A010952
- Binomial coefficient C(n,30).at n=6A010983
- a(n) = binomial(n^2, n).at n=6A014062
- Number of compositions of n into 7 ordered relatively prime parts.at n=30A023032
- a(n) = binomial(n, floor(n/6)).at n=36A051053
- Binomial coefficients C(2*n+6,6).at n=15A053135
- a(n) = binomial(n, round(sqrt(n))).at n=36A055789
- Binomial coefficient ( n, squarefree kernel(n) ).at n=35A073354
- Triangle read by rows: T(n,k) = binomial(n^2, k), 0 <= k <= n.at n=27A090642
- Triangle read by rows: T(n,k) = binomial(k*n,n), 1 <= k <= n.at n=20A096130
- Number of subsets of {1,2,...,n} in which exactly half of the elements are less than or equal to sqrt(n).at n=36A102366
- Triangle, read by rows, where T(n,k) = binomial(n*(n-1)/2 - k*(k-1)/2 + n-k+3, n-k).at n=38A107873
- Array read by antidiagonals: A(k,n) = C(n^k, n).at n=34A108131
- Triangle, read by rows, where T(n,k) = C( n*(n+1)/2 + n-k + 2, n-k), for n>=k>=0.at n=29A121336
- Triangle binomial(6*n,6*m), 0 <= m <= n, read by rows.at n=22A177810