296010
domain: N
Appears in sequences
- Figurate numbers or binomial coefficients C(n,6).at n=27A000579
- Smaller of unitary amicable pair.at n=11A002952
- Binomial coefficient C(3n, n-3).at n=6A004321
- Binomial coefficient C(27,n).at n=6A010943
- Binomial coefficient C(27,n).at n=21A010943
- a(n) = binomial(n,21).at n=6A010974
- a(n) = binomial(n, floor(n/4)).at n=27A051036
- Binomial coefficients C(2*n-5,6).at n=10A053128
- Triangle, read by antidiagonals, where T(n,k) = C(n+n*k+k, n*k+k).at n=48A060543
- Unitary amicable numbers.at n=22A063991
- Numbers k such that 2^k - 11 is prime.at n=18A096817
- Number of noncrossing trees with n edges in which no border edges emanate from the root.at n=10A102594
- Triangle read by rows: T(n,k) is the number of noncrossing trees with n edges in which the maximal number of contiguous border edges starting from the root in both directions is equal to k.at n=55A102595
- Number of rooted non-separable n-edge maps in the plane (planar with a distinguished outside face).at n=9A103938
- Triangle, read by rows, where T(n,k) = C(n*(n-1)/2 - k*(k-1)/2 + n-k, n-k).at n=29A107862
- Column 1 of triangle A107862; a(n) = binomial(n*(n+1)/2 + n, n).at n=6A107863
- Triangle read by rows: T(n,k) = binomial(4n-k,n-k), 0 <= k <= n.at n=29A119304
- Triangle, read by rows, where T(n,k) = C( n*(n+1)/2 + n-k, n-k), for n>=k>=0.at n=21A121334
- Triangle read by rows: binomial(3*n,3*k), 0 <= k <= n.at n=47A139459
- Triangle read by rows: binomial(3*n,3*k), 0 <= k <= n.at n=52A139459