A328361 Triangle read by rows: T(n,k) is the total number of k's in all partitions of n into consecutive parts, (1 <= k <= n).
1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 2, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1
Offset: 1
Examples
Triangle begins: 1; 0, 1; 1, 1, 1; 0, 0, 0, 1; 0, 1, 1, 0, 1; 1, 1, 1, 0, 0, 1; 0, 0, 1, 1, 0, 0, 1; 0, 0, 0, 0, 0, 0, 0, 1; 0, 1, 1, 2, 1, 0, 0, 0, 1; 1, 1, 1, 1, 0, 0, 0, 0, 0, 1; 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1; 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1; 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1; 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1; 1, 1, 1, 2, 2, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1; 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1; ... For n = 9 there are three partitions of 9 into consecutive parts, they are [9], [5, 4], [4, 3, 2], so the 9th row of triangle is [0, 1, 1, 2, 1, 0, 0, 0, 1].
Comments