Triangle: T(n,k) is the number of partitions of n such that some part is repeated k times and no part is repeated more than k times.

A091602

Triangle: T(n,k) is the number of partitions of n such that some part is repeated k times and no part is repeated more than k times.

Terms

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

External references