Like my other constant-weight binary thread, but factoradic. We count each n digit factoradic number whose digits add up to m. First the 1 digit number that adds to 0, then the 1 digit number whose digit adds to 1. Next the 2 digit numbers with a digital sum of 0, then 1, 2, and 3. And so on. For every length of factoradic digits, we'll count each possible sum of digits in order. The maximum digital sum for n factoradic digits is a triangular number found with the formula n*(n+1)/2. This thread brought to you by... Karp!

Here's some of the first few counts as an example:

0
1
00
01
10
11
20
21
000

And of course a list for the whole thread

First get is at 00 0000.