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