Originally Posted by

**Stereo**
0 6 3 5 5 5 5 ...

1) If the number produces a distinct integer when divided by 2, do that

2) otherwise, **count the number of segments the number represents** on a 7 segment display, and switch to that number.

I like these rules because despite being over the set of single digit integers, there are 2 stable solutions - 5 maps to itself, and the sequence 2 1 2 1 repeats forever as well.

0: 6 3 5...

1: 2 1 [...]

2: 1 2 [...]

3: 5...

4: 2 1 [...]

5: 5...

6: 3 5...

7: 3 5... | 4 2 1 [...] - depends how you display sevens

8: 4 2 1 [...]

9: 5...

Out of 10 digits, 5 map to one solution, 5 map to the other (if your seven is like '7). awesome.

## Bookmarks