593775
domain: N
Appears in sequences
- Figurate numbers or binomial coefficients C(n,6).at n=30A000579
- Binomial coefficients binomial(5n,n).at n=6A001449
- a(n) = binomial coefficient C(2n, n-9).at n=6A004315
- Binomial coefficient C(3n,n-4).at n=6A004322
- Binomial coefficient C(30,n).at n=6A010946
- Binomial coefficient C(30,n).at n=24A010946
- a(n) = binomial coefficient C(n,24).at n=6A010977
- Number of compositions of n into 7 ordered relatively prime parts.at n=24A023032
- Distinct odd numbers in the triangle of denominators in Leibniz's Harmonic Triangle.at n=30A046201
- a(n) = binomial(n, floor(n/5)).at n=30A051052
- Binomial coefficients C(2*n+6,6).at n=12A053135
- Numbers k such that 3^k == -1 (mod k-1).at n=23A055686
- Table by antidiagonals of number of ways of choosing k items from n*k.at n=49A060539
- Triangle read by rows: T(n,k) = binomial(k*n,n), 1 <= k <= n.at n=19A096130
- Maximal number of 165432 patterns in a permutation of 1,2,...,n.at n=33A100356
- Triangle, read by rows, where T(n,k) = binomial(n*(n-1)/2 - k*(k-1)/2 + n-k+3, n-k).at n=29A107873
- Column 1 of triangle A107873; a(n) = C( n*(n+1)/2 + n+3, n).at n=6A107875
- Triangle read by rows: T(n,k) = binomial(t(n) - t(k-1),k), where t(j) = j*(j+1)/2; 1<=k<=n.at n=41A110770
- Triangle read by rows: T(n,k) = binomial(4n-k,n-k), 0 <= k <= n.at n=38A119304
- Triangle read by rows: T(n,k) = number of labeled loopless digraphs with n nodes and k arcs (n >= 1, 0 <= k <= n*(n-1)).at n=51A123554