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