756756

Appears in sequences

• De Bruijn's S(3,n): (3n)!/(n!)^3.at n=5A006480
• a(n) = (5n)!/(5!^n).at n=3A014609
• Multinomial coefficient n!/([n/3]![(n+1)/3]![(n+2)/3]!).at n=15A022916
• Square array read by antidiagonals of number of ways of dividing n*k labeled items into n labeled boxes with k items in each box.at n=23A060538
• This table shows the coefficients of combinatorial formulas needed for generating the sequential sums of p-th powers of binomial coefficients C(n,5). The p-th row (p>=1) contains a(i,p) for i=1 to 5*p-4, where a(i,p) satisfies Sum_{i=1..n} C(i+4,5)^p = 6 * C(n+5,6) * Sum_{i=1..5*p-4} a(i,p) * C(n-1,i-1)/(i+5).at n=33A087109
• Table T(n,k), 0<=k, 0<=n, read by antidiagonals, defined by T(n,k) = (k*n)! / (n!)^k.at n=41A089759
• a(n) = binomial(n+5, n)*binomial(n+10, n).at n=5A104673
• a(n) = C(n+5,5)*C(n+10,5).at n=5A104679
• a(n) = binomial(2*n, n) * binomial(2*n+5, n).at n=5A113894
• Triangle read by rows: T(n, k) = (n*k)!/(n!)^k.at n=12A120666
• Number of 3*n X 15 0..1 arrays with row sums 5 and column sums n.at n=0A172571
• Number of 5*n X n 0..1 arrays with row sums 2 and column sums 10.at n=2A172586
• Number of 3*n X 15 0..2 arrays with row sums 5 and column sums n.at n=0A172670
• Number of 3*n X 15 0..3 arrays with row sums 5 and column sums n.at n=0A172769
• Number of 3*n X 15 0..4 arrays with row sums 5 and column sums n.at n=0A172837
• Number of 3*n X 15 0..5 arrays with row sums 5 and column sums n.at n=0A172885
• Number of permutations of 5 copies of 1..n with all adjacent differences <= 2 in absolute value.at n=3A177302
• Number of permutations of 5 copies of 1..n with all adjacent differences <= 3 in absolute value.at n=3A177303
• De Bruijn's triangle, T(m,n) = (m*n)!/(n!^m) read by downward antidiagonals.at n=39A187783
• Number of subsets of {1,2,...,n-8} without differences equal to 2, 4, 6 or 8.at n=53A224811