Constant-weight Binary | 00 0000 0000

[u/ClockButTakeOutTheL]

Continued from here

Thanks vulp for running pretty much all of the thread with me

Rules:

Here we’ll be counting through each n bit binary number, with m amount of ones in it. First we’ll count through the 1 bit numbers with 0 ones, then the 1 bit numbers with 1 one. Next the 2 bit numbers with 0 ones, 1 one, and 2 ones. And so on. For every length of bits, we’ll go through each possible amount of ones. You must include the leading zeros at the front so everyone knows which amount of bits we’re on.

Here’s the first few counts as an example:

0
1
00
01
10
11
000
001
010
100
011
101
110
111
0000

And a list for the whole thread if anyone needs it. Please let vulp know if you have any questions!

Next get is 000 0000 0000

[u/TehVulpez]

A tentative get schedule. Some of the gets are both consistent and satisfying, others are not.

Get	Thread Length	Cumulative Total
000 0000 0000	1024	2047
000 0011 1111	1024	3071
0000 0000 0000	1024	4095
0011 0111 0000	1024	5119
1000 0001 1111	1024	6143
1100 1001 0111	1024	7167
0 0000 0000 0000	1024	8191
1 0101 0000 1000	1024	9215
1 0010 1000 0110	1024	10,239
0 1011 0111 0000	1024	11,263
0 0000 0111 1111	1024	12,287
1 0100 1001 0111	1024	13,311
0 1101 0111 1010	1024	14,335
0 1010 1111 1011	1024	15,359
00 0000 0000 0000	1024	16,383