818809200
domain: N
Appears in sequences
- Binomial coefficients C(2n+1, n-2).at n=14A003516
- Binomial coefficient C(33,n).at n=14A010949
- Binomial coefficient C(33,n).at n=19A010949
- a(n) = binomial coefficient C(n,14).at n=19A010967
- a(n) = binomial(n,19).at n=14A010972
- T(2n+5,n), array T as in A050186; a count of aperiodic binary words.at n=14A051198
- a(n) = binomial(floor(n*(1+sqrt(2))),n) for n>=0.at n=14A135965
- Binomial coefficients binomial(n,k) = uv such that n>=2k and u > v, where gpf(u) < k, gpf(v) >= k (gpf(n)= is the greatest prime factor of n).at n=8A286980
- Binomial coefficients binomial(n,k) = UV such that n>=2k and U > V, where gpf(U) <= k, gpf(V) > k (gpf(n)= is the greatest prime factor of n).at n=15A286981
- 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=28A340554
- a(n) = least number in row n of Pascal's triangle that exceeds every number in row n-1.at n=31A382851