As a square array T(n,k) by antidiagonals, number of ways of partitioning k into up to n parts each no more than 5, or into up to 5 parts each no more than n; as a triangle t(n,k), number of ways of partitioning n into exactly k parts each no more than 6 (i.e., of arranging k indistinguishable standard dice to produce a total of n).

A069713

As a square array T(n,k) by antidiagonals, number of ways of partitioning k into up to n parts each no more than 5, or into up to 5 parts each no more than n; as a triangle t(n,k), number of ways of partitioning n into exactly k parts each no more than 6 (i.e., of arranging k indistinguishable standard dice to produce a total of n).

Terms

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

External references