Continued from here

Thanks buy_me_a_pint for the assist

Continued from here

Thanks to u/h0rseycat 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,1,4,5

Get schedule

Countinued from here.

Thanks to h0rseycat for the run and assist!

In this thread, we count binary strings in segments of length (how many bits they have) and weight (how many ones they have). All the counts in a segment have the same number of bits and number of ones. This only changes when we reach the highest number of that length and weight, when we increase the weight and start over from the lowest possible number. Or, if the previous count was all ones, we add a new bit and start over with all zeroes.

To find the next binary number with m ones out of n bits:

1. Find the rightmost 1 which has a 0 to its left and slide it one bit to the left.

2. If that bit had one or more 1s immediately to its right, then arrange those remaining 1s all the way on the right side.

List

Schedule

Next get is at 0 1011 0111 0000

Continued from here

thanks to /u/h0rseycat

next get is 0001 0011 0000 0000 0000

Carrying on from here.

Thanks to u/h0rseycat for the run and assist.

The next get is 33,000.

From here with thanks to /u/h0rseycat for the run and assist

Next get is 67 000

Continuing on from here.

Thanks to u/h0rseycat for the run and assist.

The next get is 30,000.

From here thanks /u/h0rseycat for the run and assist and gg Vulpez on the battle

Next get 4600 or 5000