129024480
domain: N
Appears in sequences
- a(n) = binomial(n,11).at n=21A001288
- Binomial coefficient C(2n,n-5).at n=11A004311
- Binomial coefficient C(32,n).at n=11A010948
- Binomial coefficient C(32,n).at n=21A010948
- a(n) = binomial(n,21).at n=11A010974
- Number of combinations of n objects taken pi(n) at a time.at n=32A037031
- a(n) = binomial(2^n, prime(n)).at n=4A060497
- a(n) = binomial(sigma(n), n).at n=20A066090
- Staircase on Pascal's triangle.at n=21A081204
- Number of compositions (= ordered integer partitions) of n into 2n parts.at n=11A165817
- Triangle T read by rows: n-th row (n>=0) gives the non-vanishing coefficients of the polynomial q(n,x) = ((x+1)^(2^n) - (x-1)^(2^n))/2.at n=21A281122
- Triangle T read by rows: n-th row (n>=0) gives the non-vanishing coefficients of the polynomial q(n,x) = ((x+1)^(2^n) - (x-1)^(2^n))/2.at n=26A281122
- Number of ordered rooted binary trees with n leaves and with minimal Sackin tree balance index.at n=43A345135