4272048
domain: N
Appears in sequences
- a(n) = binomial coefficient C(n,7).at n=26A000580
- Binomial coefficient C(3n,n-4).at n=7A004322
- Binomial coefficient C(33,n).at n=7A010949
- Binomial coefficient C(n,26).at n=7A010979
- T(n,7), array T as in A050186; a count of aperiodic binary words.at n=26A051192
- Binomial coefficients C(2*n+7,7).at n=13A053136
- Central column of triangle A102427.at n=13A102428
- a(n) = binomial(n, A002024(n+1)-1) where A002024 is "n appears n times".at n=33A180272
- Number of nonnegative integer arrays of length n summing to n without equal adjacent values modulo 2.at n=26A221315
- Triangle such that the g.f. of column k equals 1/(1-x)^(k^3) for k>=0, as read by rows.at n=58A230049
- 3-parking triangle T(r, i, 3) read by rows: T(r, i, k) = (r + 1)^(i-1)*binomial(k*(r + 1) + r - i - 1, r - i) with k = 3 and 0 <= i <= r.at n=37A329059
- 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=34A340554
- Number of subsets of [n] in which exactly half of the elements are Fibonacci numbers.at n=33A357927