Number A(n,k) of permutations of k indistinguishable copies of 1..n with every partial sum <= the same partial sum averaged over all permutations; square array A(n,k), n>=0, k>=0, read by antidiagonals.
A215561
Number A(n,k) of permutations of k indistinguishable copies of 1..n with every partial sum <= the same partial sum averaged over all permutations; square array A(n,k), n>=0, k>=0, read by antidiagonals.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =1a(5) =1a(6) =1a(7) =1a(8) =1a(9) =1a(10) =1a(11) =1a(12) =2a(13) =3a(14) =1a(15) =1a(16) =1a(17) =5a(18) =30a(19) =7a(20) =1a(21) =1a(22) =1a(23) =14a(24) =420a(25) =403a(26) =35a(27) =1a(28) =1a(29) =1
External references
- oeis: A215561