Count up in a somewhat complex way

[Shidoshi]

So we have hex. We have binary. We have base 110. How could I make it more complex?

By changing the bases dependant on the digit.

The base will be (distance from decimal place + 1). So the ones place will count up in base 2, the tens place will be base 3, the hundreds will be base 4, etc.

Here's an example of the first ten posts:

1
10
11
20
21
100
101
110
111
120

etc.

I shall start:

1


Yes, this will be complicated. The first digit of the number is in base 2, second in base 3, third in base 4, etc.

[Jedward]

...
10

[Raul]

11

[Nalek]

..20?

[shouri]

anyone who didn't understand just follow this guideline:

units digit (0 or 1 only)
tens (0 1 or 2)
hundreds (0 1 2 or 3)
.
.
.

also, yes "20" was fine


Also....


21

[Valon]

100

[Yokuyin]

101

I assume if we reach 9987654321 (= 3.627.999 in base 10), the next one is A0000000000?

[Shidoshi]

I assume if we reach 9987654321 (= 3.627.999 in base 10), the next one is A0000000000?

eyup

110

[Holypie]

111

[Unauthorized Intruder]

120

[Shidoshi]

121

[octopusprime]

tooooo huntert

[OB3LISK]

I didn't get it so idk what comes next, but I'll post anyway for the fun.

[Shidoshi]

I didn't get it so idk what comes next, but I'll post anyway for the fun.

This is not the shenanigans.

201

[Chainspark]

210

[sicnarf]

211

[octopusprime]

220

[Shidoshi]

221

[Panacea]

300.

[sicnarf]

301

[octopusprime]

301 + 9

Sonufabitch.

[Baklava]

100 + 100 + 100 + 5 + 5 + 1

[octopusprime]

2^6×5

I like where this is going.

[Noah]

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


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

[Shidoshi]

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

1000

[Fius]

..1001?
Possible combo breaker

[Unauthorized Intruder]

1010

[Shidoshi]

1011

[shouri]

1020

[Holypie]

1021 I hope

[octopusprime]

1300

[Shidoshi]

1300

urdoinitwrong

1101 (correct counting)

[octopusprime]

urdoinitwrong

1101 (correct counting)

1300 IT WILL BE RIGHT EVENTUALLY

1111

[Turtally]

1120, I think.

[octopusprime]

1121

[Turtally]

1200

[sicnarf]

1201

[Turtally]

1210

[Shidoshi]

1211

your cue, octopus.

[Unauthorized Intruder]

1220

[Tenshi]

1221

[octopusprime]

1300

toldja

[Shidoshi]

1301

[Kalovale]

1310

I read "so we have sex" for the intro... and thought what kinda game is this.

[Derosis]

1311

[Shidoshi]

1310

I read "so we have sex" for the intro... and thought what kinda game is this.

What a silly pony...

1320

[Kalovale]

What a silly pony...

1320


public static int shidoCount(int ini) {
int place = 1;
int digit;
boolean maxBase;
int copy = ini;
do {
maxBase = true;
digit = copy%10; // extract right-most digit
if(digit < place) {
maxBase = false;
}
else {
copy = copy/10; // cut off the right-most digit
ini -= digit*Math.pow(10, place-1);
place++; // keep track of the place of the 'current' right most digit
}

} while(maxBase && copy > 0);

if(!maxBase) {
ini += Math.pow(10, place-1);
}
else {
ini = (int) Math.pow(10, place-1);
}
return ini;
}


1321

[Luacake]

2000

[Shidoshi]

2001