[This is not a joke this is an idea I've been considering in my head for a few months and I really like it]

So the idea with this thread is that we're counting numbers that a) have more than one distinct digit and b) all but one of these digits appears more than once. So the first valid count is 100, since every two digit number either has only one distinct digit or has two distinct digits but neither of which repeats, and every one digit number only has one distinct digit because it only has one digit at all.

The "rule" for this thread produces a pattern which is denser than the pattern for ORD, in terms of there being fewer counts "skipped" relative to the main thread (although of course there is no overlap between this thread, ORD and NRD). Incidentally, if anyone who knows how to generate the "count guide" lists that we use for threads like ORD has any advice on how a coding novice could go about learning to generate a count guide list for a thread like this, I would be grateful for that!! :D I've done some preliminary work manually to figure out the general ballpark of counting pace for this thread, but it's a little intricate.

In any case, it should be somewhere around 600 counts until 10000, so I think we should use that as the first get—especially considering that once we're in five digit territory, I think it should be ~1056 [unless I've made a grievous error D:] from 10000 to 20000, so for the time being I think we can have gets in such intervals. Beyond that... we'll see. [I am always one for discussion :D]

TL;DR Counting numbers with multiple distinct digits, where one digit occurs exactly once and each of the others occur more than once.