8347680
domain: N
Appears in sequences
- a(n) = binomial coefficient C(n,7).at n=29A000580
- Binomial coefficient C(2n,n-11).at n=7A004317
- Binomial coefficient C(3n,n-5).at n=7A004323
- a(n) = C(4n,n-2).at n=7A004332
- Binomial coefficient C(36,n).at n=7A010952
- Binomial coefficient C(n,29).at n=7A010982
- Number of compositions of n into 8 ordered relatively prime parts.at n=29A023033
- a(n) = (n+1)*binomial(n+5, 5).at n=29A027810
- a(n) = binomial(n, floor(n/5)).at n=36A051052
- T(n,7), array T as in A050186; a count of aperiodic binary words.at n=29A051192
- Binomial coefficients C(2*n-6,7).at n=14A053129
- Number of labeled pure 2-complexes on n nodes (0-simplexes) with 5 2-simplexes and 8 1-simplexes.at n=29A054559
- a(n) = C(5*n+1,n).at n=7A079589
- Central column of triangle A102427.at n=14A102428
- Triangle, read by rows, where T(n,k) = C(n*(n-1)/2-k*(k-1)/2+n-k+1,n-k).at n=37A107867
- Column 1 of triangle A107867; a(n) = binomial( n*(n+1)/2 + n+1, n).at n=7A107869
- Triangle, read by rows, where T(n,k) = C( n*(n+1)/2 + n-k + 1, n-k), for n>=k>=0.at n=28A121335
- Triangle T(n, k, m) = f(n, m)/(f(k, m)*f(n-k, m)), where T(0, k, m) = 1, f(n, k) = Product_{j=1..n} ( j!*((k+1)^j -1)/k ), f(n, 0) = n!, and m = 3, read by rows.at n=17A156767
- Triangle T(n, k, m) = f(n, m)/(f(k, m)*f(n-k, m)), where T(0, k, m) = 1, f(n, k) = Product_{j=1..n} ( j!*((k+1)^j -1)/k ), f(n, 0) = n!, and m = 3, read by rows.at n=18A156767
- Triangle of Generalized Runyon numbers R_{n,k}^(4) read by rows.at n=43A173621