237336

Appears in sequences

• Binomial coefficients C(n,5).at n=33A000389
• Binomial coefficients C(2*n+5,5).at n=14A002299
• Triangulations of the disk G_{n,2}.at n=7A002711
• Binomial coefficient C(3n,n-6).at n=5A004324
• Binomial coefficient C(33,n).at n=5A010949
• Binomial coefficient C(n,28).at n=5A010981
• T(n,5), array T as in A050186; a count of aperiodic binary words.at n=28A050190
• a(n) = binomial(n, floor(n/6)).at n=33A051053
• Number of subsets of {1,2,...,n} in which exactly half of the elements are less than or equal to sqrt(n).at n=33A102366
• Triangle, read by rows, where T(n,k) = binomial(n*(n-1)/2 - k*(k-1)/2 + n-k+3, n-k).at n=39A107873
• Triangle, read by rows, where T(n,k) = C( n*(n+1)/2 + n-k, n-k), for n>=k>=0.at n=30A121334
• a(n) = binomial(2^n + 1, n).at n=5A136505
• Square array, read by antidiagonals, where T(n,k) = binomial(2^k + n-1, k).at n=33A136555
• Triangle T(n, k) = binomial(n*(n+1)/2 + k, k), read by rows.at n=41A176566
• Number of length 5 arrays x(i), i=1..5 with x(i) in i..i+n and no value appearing more than 2 times.at n=10A250354
• Square array T(n,m) (n>=0, m>=0) read by antidiagonals downwards giving number of rooted triangulations of type [n,m] up to orientation-preserving isomorphisms.at n=52A262586
• 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=35A340554
• Number of ways to choose a multiset of n divisors of n.at n=27A343935
• Dirichlet g.f.: Product_{k>=2} 1 / (1 - k^(-s))^binomial(k+4,5).at n=28A344205
• Number of subsets of {1..n-1} whose cardinality is one less than the length of the binary expansion of n; a(0) = 0.at n=34A370819