Triangle T(n,k) = number of partitions of n into k distinct parts, 1 <= k <= n.
A060016
Triangle T(n,k) = number of partitions of n into k distinct parts, 1 <= k <= n.
Terms
- a(0) =1a(1) =1a(2) =0a(3) =1a(4) =1a(5) =0a(6) =1a(7) =1a(8) =0a(9) =0a(10) =1a(11) =2a(12) =0a(13) =0a(14) =0a(15) =1a(16) =2a(17) =1a(18) =0a(19) =0a(20) =0a(21) =1a(22) =3a(23) =1a(24) =0a(25) =0a(26) =0a(27) =0a(28) =1a(29) =3
External references
- oeis: A060016