1107568

Appears in sequences

• Figurate numbers or binomial coefficients C(n,6).at n=33A000579
• Binomial coefficient C(3n,n-5).at n=6A004323
• Binomial coefficient C(33,n).at n=6A010949
• a(n) = binomial(n,27).at n=6A010980
• a(n) = binomial(n, floor(n/5)).at n=33A051052
• Binomial coefficients C(2*n-5,6).at n=13A053128
• a(n) = binomial(n, round(sqrt(n))).at n=33A055789
• Number of orbits of the wreath product of S_n with S_n on n X n matrices over {0,1,2}.at n=6A099121
• Triangle, read by rows, where T(n,k) = C(n*(n-1)/2 - k*(k-1)/2 + n-k, n-k).at n=38A107862
• Duplicate of A099121.at n=6A107864
• Triangle, read by rows, where T(n,k) = C( n*(n+1)/2 + n-k - 1, n-k), for n>=k>=0.at n=29A122178
• a(n) = binomial(n, sum_digits_n).at n=33A128936
• Triangle read by rows, T(n, k) = binomial(3*(prime(n+1) - 1)/2, 3*(prime(k+1) - 1)/2) with T(n,0) = 1.at n=38A154652
• Triangle read by rows, T(n, k) = binomial(3*(prime(n+1) - 1)/2, 3*(prime(k+1) - 1)/2) with T(n,0) = 1.at n=43A154652
• a(n) = n*(n+1)*(7*n^2 - n - 4)/4.at n=28A172077
• Triangle: T(n,k)=C(4n+1,2k), 0<=k<=n.at n=39A193634
• Triangle T(n,k) = binomial(5*n - 4*k, 4*n - 3*k), 0 <= k <= n.at n=48A264774
• Array read by antidiagonals: A(n,k) is the number of n element multisets of n element multisets of a k-set.at n=51A331436
• T(n, k) = [x^k] hypergeom([-2^n/2, -2^n/2 - 1/2], [1/2], x). Triangle read by rows, T(n, k) for n >= 0.at n=24A340554
• Number of subsets of [n] in which exactly half of the elements are powers of 2.at n=33A357812