169911
domain: N
Appears in sequences
- Binomial coefficients C(n,5).at n=31A000389
- Binomial coefficients C(2*n+5,5).at n=13A002299
- Binomial coefficient C(31,n).at n=5A010947
- Binomial coefficient C(31,n).at n=26A010947
- Binomial coefficient C(n,26).at n=5A010979
- Molien series for complete weight enumerator of self-dual code over GF(5) containing all-1's vector.at n=33A028345
- T(n,5), array T as in A050186; a count of aperiodic binary words.at n=26A050190
- a(n) = binomial(n, floor(n/6)).at n=31A051053
- Partial sums of A007584.at n=26A051740
- a(n) = binomial(sigma(n),tau(n)), where sigma(n) is the sum and tau(n) the number of divisors of n (A000203, A000005).at n=15A068904
- a(n) = C(6*n+1,n).at n=5A079590
- Number of connected ordered 5-element T_0-antichains on an unlabeled n-set.at n=26A092608
- Number of subsets of {1,2,...,n} in which exactly half of the elements are less than or equal to sqrt(n).at n=31A102366
- Triangle, read by rows, where T(n,k) = C(n*(n-1)/2-k*(k-1)/2+n-k+1,n-k).at n=39A107867
- Sum{k>=0, C(2^k-1,n-2*(2^k-1))}.at n=67A119969
- a(n) = binomial(prime(3+n), prime(3)).at n=8A126996
- Square array, read by antidiagonals, where T(n,k) = binomial(2^k + n-1, k).at n=20A136555
- a(n) = binomial(2^n - 1, n).at n=5A136556
- Triangle such that the g.f. of column k equals 1/(1-x)^(k^3) for k>=0, as read by rows.at n=39A230049
- The least nonsquarefree number on row n of Pascal's triangle, or 1 if all the terms on that row are squarefree.at n=31A249716