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