Triangle: T(n,k) = number of partitions of n (>=2) with no subsum equal to k (1 <= k <= n-1).

A046663

Triangle: T(n,k) = number of partitions of n (>=2) with no subsum equal to k (1 <= k <= n-1).

Terms

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

External references