4961755
domain: N
Appears in sequences
- Number of permutations of 4 indistinguishable copies of 1..n with exactly 4 adjacent element pairs in decreasing order.at n=3A151642
- Number of permutations of 4 indistinguishable copies of 1..n with exactly 8 adjacent element pairs in decreasing order.at n=3A151646
- Irregular triangle read by rows: T(n,k) = Sum_{i=0..k} (-1)^i * binomial(4*n+1,i) * binomial(k+4-i,4)^n, 0 <= k <= 4*(n-1).at n=19A236463
- Irregular triangle read by rows: T(n,k) = Sum_{i=0..k} (-1)^i * binomial(4*n+1,i) * binomial(k+4-i,4)^n, 0 <= k <= 4*(n-1).at n=23A236463
- Triangle in which the g.f. for row n is (1-x)^(4*n+1) * Sum_{j>=0} binomial(n+j-1,j)^4 * x^j, read by rows of k=0..3*n terms.at n=26A262014
- Triangle in which the g.f. for row n is (1-x)^(4*n+1) * Sum_{j>=0} binomial(n+j-1,j)^4 * x^j, read by rows of k=0..3*n terms.at n=30A262014
- a(n) = [x^n] (1-x)^(4*n+1) * Sum_{k>=0} binomial(n+k-1,k)^4 * x^k.at n=4A262015