84672315
domain: N
Appears in sequences
- a(n) = binomial(n,11).at n=20A001288
- Binomial coefficient C(31,n).at n=11A010947
- Binomial coefficient C(31,n).at n=20A010947
- a(n) = binomial(n,20).at n=11A010973
- a(n) = binomial(2n+1,n-4).at n=11A030054
- Number of combinations of n objects taken pi(n) at a time.at n=31A037031
- a(n) = binomial(n, floor((n-8)/2)).at n=31A037958
- a(n) = binomial(prime(n), n) where prime(n) = n-th prime.at n=10A060604
- a(n) = binomial(sigma(n), phi(n)).at n=24A064366
- a(n) = binomial(prime(n), composite(n)).at n=10A073765
- Staircase on Pascal's triangle.at n=20A081181
- Row sums of triangle A099575.at n=20A099576
- a(n) = binomial coefficient C(m,k) with minimal (m,k) and exactly n distinct digits in decimal representation.at n=7A101599
- Let c = composite(n) & p = prime(n); a(n) = binomial( max(c,p), min(c,p) ).at n=10A109903
- a(n) = binomial(3*n+1, n+1).at n=10A117671
- a(n) = binomial(prime(n+5), prime(5)).at n=6A126998