T(n,k) = number of partitions of binomial(n,k), 0<=k<=n, triangular array read by rows.

Terms

a(0) =1a(1) =1a(2) =1a(3) =1a(4) =2a(5) =1a(6) =1a(7) =3a(8) =3a(9) =1a(10) =1a(11) =5a(12) =11a(13) =5a(14) =1a(15) =1a(16) =7a(17) =42a(18) =42a(19) =7a(20) =1a(21) =1a(22) =11a(23) =176a(24) =627a(25) =176a(26) =11a(27) =1a(28) =1a(29) =15