A371788 Triangle read by rows where T(n,k) is the number of set partitions of {1..n} with exactly k distinct block-sums.
1, 0, 1, 0, 1, 1, 0, 2, 2, 1, 0, 2, 8, 4, 1, 0, 2, 19, 24, 6, 1, 0, 2, 47, 95, 49, 9, 1, 0, 6, 105, 363, 297, 93, 12, 1, 0, 12, 248, 1292, 1660, 753, 158, 16, 1, 0, 11, 563, 4649, 8409, 5591, 1653, 250, 20, 1, 0, 2, 1414, 15976, 41264, 38074, 15590, 3249, 380, 25, 1
Offset: 0
Examples
The set partition {{1,3},{2},{4}} has two distinct block-sums {2,4} so is counted under T(4,2). Triangle begins: 1 0 1 0 1 1 0 2 2 1 0 2 8 4 1 0 2 19 24 6 1 0 2 47 95 49 9 1 0 6 105 363 297 93 12 1 0 12 248 1292 1660 753 158 16 1 0 11 563 4649 8409 5591 1653 250 20 1 0 2 1414 15976 41264 38074 15590 3249 380 25 1 Row n = 4 counts the following set partitions: . {{1,4},{2,3}} {{1},{2,3,4}} {{1},{2},{3,4}} {{1},{2},{3},{4}} {{1,2,3,4}} {{1,2},{3},{4}} {{1},{2,3},{4}} {{1,2},{3,4}} {{1},{2,4},{3}} {{1,3},{2},{4}} {{1,4},{2},{3}} {{1,3},{2,4}} {{1,2,3},{4}} {{1,2,4},{3}} {{1,3,4},{2}}