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