Count up in a somewhat complex way

301 + 9

Sonufabitch.

100 + 100 + 100 + 5 + 5 + 1

2^6×5

I like where this is going.

Ah, the factorial number system! Used to map a single number n to a single permutation of an array. Been used quite much, actually. It's a good tool.

321

Code:

def toFNS(n):
    k = 0
    while fact(k) <= n:
        k += 1
    indexList = []
    numberList = range(k).reversed()
    for x in numberList:
        quot = n // fact(x)
        indexList.append(quot)
        n %= fact(x)
    return indexList

Noah

The idea was shamelessly stolen from another site, the xkcd forums.

1000

..1001?

 Spoiler

Possible combo breaker

1010

1011

1020

1021 I hope

1300

1300

urdoinitwrong

1101 (correct counting)

urdoinitwrong

1101 (correct counting)

1300 IT WILL BE RIGHT EVENTUALLY

1111

1120, I think.

1121

1200

1201

1210

1211

your cue, octopus.

1220