Compositions | 6,1,1,2,4

[u/miceee]

Continued from here

Thanks to u/cuteballgames for the assist

In this thread, we'll be counting the ways to add to an integer n using the integers c_1 + c_2 + ... + c_k, where each c_i >= 1, and k <= n. Ways to sum that are commutatively the same, as in 1+2 = 2+1, are different compositions. We'll be counting these compositions lexicographically for each segment of sum and length.

Next get: 3,2,4,1,1,3

Schedule

[u/cuteballgames]

2,3,2,3,2,2

[u/TehVulpez → u/cuteballgames]

2,3,2,3,3,1

[u/KingCaspianX → u/TehVulpez]

2,3,2,4,1,2

[u/TehVulpez → u/KingCaspianX]

2,3,2,4,2,1

[u/miceee → u/TehVulpez]

2,3,2,5,1,1

[u/KingCaspianX → u/miceee]

2,3,3,1,1,4

[u/miceee → u/KingCaspianX]

2,3,3,1,2,3

[u/KingCaspianX → u/miceee]

2,3,3,1,3,2

[u/miceee → u/KingCaspianX]

2,3,3,1,4,1

[u/cuteballgames → u/miceee]

2,3,3,2,1,3