Triangle read by rows: T(n,k) is the number of partitions of [1, 2, ..., k] into exactly n blocks, each of size 1, 2 or 3 (n >= 0, 0 <= k <= 3n).

A144385

Triangle read by rows: T(n,k) is the number of partitions of [1, 2, ..., k] into exactly n blocks, each of size 1, 2 or 3 (n >= 0, 0 <= k <= 3n).

Terms

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

External references