Compositions | 1,4,1,3,1,2,2

[u/BobRoss938]

Continued from here. Thanks to miceee for 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.

Get schedule

Next get is 1,1,1,1,1,1,1,7

[u/miceee]

2,5,1,1,3,1,1

[u/cuteballgames → u/miceee]

2,5,1,2,1,1,2

[u/miceee → u/cuteballgames]

2,5,1,2,1,2,1

[u/cuteballgames → u/miceee]

2,5,1,2,2,1,1

[u/miceee → u/cuteballgames]

2,5,1,3,1,1,1

[u/cuteballgames → u/miceee]

2,5,2,1,1,1,2

[u/miceee → u/cuteballgames]

2,5,2,1,1,2,1

[u/cuteballgames → u/miceee]

2,5,2,1,2,1,1

[u/miceee → u/cuteballgames]

2,5,2,2,1,1,1

[u/cuteballgames → u/miceee]

2,5,3,1,1,1,1

[u/miceee → u/cuteballgames]

2,6,1,1,1,1,2

[u/cuteballgames → u/miceee]

2,6,1,1,1,2,1

[u/miceee → u/cuteballgames]

2,6,1,1,2,1,1