134596
domain: N
Appears in sequences
- Figurate numbers or binomial coefficients C(n,6).at n=24A000579
- a(n) = binomial(3n+6, n).at n=6A003408
- Binomial coefficient C(2n,n-6).at n=6A004312
- a(n) = (2^n/n!) * Product_{k=0..n-1} (4*k + 3).at n=6A004982
- a(n) = (2^n/n!) * Product_{k=0..n-1} (4*k + 7).at n=5A004986
- a(n) = binomial(4n,n).at n=6A005810
- Binomial coefficient C(24,n).at n=6A010940
- Binomial coefficient C(24,n).at n=18A010940
- a(n) = binomial(n,18).at n=6A010971
- Expansion of (1-4*x)^(11/2).at n=18A020923
- Number of compositions of n into 7 ordered relatively prime parts.at n=18A023032
- Binomial coefficients: C(n,k), 6 <= k <= n-6, sorted, duplicates removed.at n=27A024758
- a(n) = binomial(n, floor(n/4)).at n=24A051036
- Binomial coefficients C(2*n+6,6).at n=9A053135
- Table by antidiagonals of number of ways of choosing k items from n*k.at n=39A060539
- a(n) = binomial(sigma(n), phi(n)).at n=13A064366
- Triangle T(n,k) = d(n-k,n), 0 <= k <= n, where d(l,m) = Sum_{k=l..m} 2^k * binomial(2*m-2*k, m-k) * binomial(m+k, m) * binomial(k, l).at n=27A067001
- Binomial coefficient ( n, squarefree kernel(n) ).at n=23A073354
- a(n) = binomial(phi(n+1),phi(n)).at n=37A078503
- a(n) = binomial(n!,(n-1)!).at n=3A080911