4050864
domain: N
Appears in sequences
- Number of permutations of 6 indistinguishable copies of 1..n with exactly 5 adjacent element pairs in decreasing order.at n=2A151654
- Triangle in which the g.f. for row n is [Sum_{k>=0} C(n+k-1,k)^3*x^k]*(1-x)^(3n+1), read by rows of k=0..2n terms.at n=41A181544
- Triangle in which the g.f. for row n is [Sum_{k>=0} C(n+k-1,k)^3*x^k]*(1-x)^(3n+1), read by rows of k=0..2n terms.at n=43A181544
- Irregular triangle read by rows: T(n,k) = Sum_{i=0..k} (-1)^i * binomial(6*n+1,i) * binomial(k+6-i,6)^n, 0 <= k <= 6*(n-1).at n=13A237252
- Irregular triangle read by rows: T(n,k) = Sum_{i=0..k} (-1)^i * binomial(6*n+1,i) * binomial(k+6-i,6)^n, 0 <= k <= 6*(n-1).at n=15A237252
- a(n) = A181544(2n, 2n-1).at n=2A293286