Triangle read by rows: T(n,k) = number of partitions of [1..k] into n nonempty clumps of sizes 1, 2, 3 or 4 (n >= 0, 0 <= k <= 4n).

A144643

Triangle read by rows: T(n,k) = number of partitions of [1..k] into n nonempty clumps of sizes 1, 2, 3 or 4 (n >= 0, 0 <= k <= 4n).

Terms

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

External references