Triangle read by rows: T(n,k) is the sum of the number of the arrangements of p_1 1's, p_2 2's, ..., p_k k's (p_1 + p_2 + ... + p_k = n and p_1 >= p_2 >= ... >= p_k) avoiding equal consecutive terms, where 1 <= k <= n.

A321686

Triangle read by rows: T(n,k) is the sum of the number of the arrangements of p_1 1's, p_2 2's, ..., p_k k's (p_1 + p_2 + ... + p_k = n and p_1 >= p_2 >= ... >= p_k) avoiding equal consecutive terms, where 1 <= k <= n.

Terms

    a(0) =1a(1) =0a(2) =2a(3) =0a(4) =1a(5) =6a(6) =0a(7) =2a(8) =6a(9) =24a(10) =0a(11) =1a(12) =14a(13) =36a(14) =120a(15) =0a(16) =2a(17) =40a(18) =108a(19) =240a(20) =720a(21) =0a(22) =1a(23) =59a(24) =348a(25) =900a(26) =1800a(27) =5040a(28) =0a(29) =2

External references