128124
domain: N
Appears in sequences
- Number of permutations of 3 indistinguishable copies of 1..n with exactly 4 adjacent element pairs in decreasing order.at n=3A151634
- Number of permutations of 3 indistinguishable copies of 1..n with exactly 5 adjacent element pairs in decreasing order.at n=3A151635
- Irregular triangle read by rows: T(n,k) = Sum_{i=0..k} (-1)^i * binomial(3*n+1,i) * binomial(k+3-i,3)^n, 0 <= k <= 3*(n-1).at n=16A174266
- Irregular triangle read by rows: T(n,k) = Sum_{i=0..k} (-1)^i * binomial(3*n+1,i) * binomial(k+3-i,3)^n, 0 <= k <= 3*(n-1).at n=17A174266
- 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=16A262014
- 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=17A262014
- G.f.: Sum_{k>=1} (k^4 * x^(k^2) / Product_{j=1..k} (1 - x^j)).at n=41A333152