Triangle T(n,k): number of ways of partitioning the n-element multiset {1,1,2,3,...,n-1} into exactly k nonempty parts, n>=1 and 1<=k<=n.
A241500
Triangle T(n,k): number of ways of partitioning the n-element multiset {1,1,2,3,...,n-1} into exactly k nonempty parts, n>=1 and 1<=k<=n.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =2a(5) =1a(6) =1a(7) =5a(8) =4a(9) =1a(10) =1a(11) =11a(12) =16a(13) =7a(14) =1a(15) =1a(16) =23a(17) =58a(18) =41a(19) =11a(20) =1a(21) =1a(22) =47a(23) =196a(24) =215a(25) =90a(26) =16a(27) =1a(28) =1a(29) =95
External references
- oeis: A241500