411180
domain: N
Appears in sequences
- Number of ways to put n copies of 1,2,3,4 into sets.at n=8A175707
- Number of (8*n) X n binary arrays with rows in nonincreasing order and 8 ones in every column.at n=3A188394
- Consider coefficients U(m,L,k) defined by the identity Sum_{k=1..L} Sum_{j=0..m} A302971(m,j)/A304042(m,j) * k^j * (T-k)^j = Sum_{k=0..m} (-1)^(m-k) * U(m,L,k) * T^k that holds for all positive integers L,m,T. This sequence gives 4-column table read by rows, where the n-th row lists coefficients U(3,n,k) for k = 0, 1, 2, 3; n >= 1.at n=18A316387
- Expansion of 420*x*(1 + x)*(1 + 10*x + x^2) / (1 - x)^6.at n=4A317983