| Radix Character Encoding | |||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | A | B | C | D | E | F |
| G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V |
| W | X | Y | Z | a | b | c | d | e | f | g | h | i | j | k | l |
| m | n | o | p | q | r | s | t | u | v | w | x | y | z | Α | Β |
| Γ | Δ | Ε | Ζ | Η | Θ | Ι | Κ | Λ | Μ | Ν | Ξ | Ο | Π | Ρ | Σ |
| Τ | Υ | Φ | Χ | Ψ | Ω | α | β | γ | δ | ε | ζ | η | θ | ι | κ |
| λ | μ | ν | ξ | ο | π | ρ | ς | σ | τ | υ | φ | χ | ψ | ω | А |
| Color Key | ||
|---|---|---|
| Orange | Fixed Point | number that becomes itself after one iteration |
| Green | Final Numbers | all numbers eventually reached, from all cycles |
| Purple | Cycle Start | iterations include entry into cycle, assuming it repeats |
| Red | Full Cycle | iterations include entire cycle, proving it repeats |
| Blue | Start Numbers | subset (optimization) of all numbers; minimal for full coverage |
| Gray | No Results | any calculation that has no results |
| Digits | # Start Numbers | # Fixed Points (excluding zero) |
# Cycles (including fixed) (excluding zero) |
Full Cycle Max Length |
Avg Steps including Cycle Start |
Max Steps including Cycle Start |
Avg Steps including Full Cycle |
Max Steps including Full Cycle |
# Final Numbers (excluding zero) |
|---|---|---|---|---|---|---|---|---|---|
| 1 | 111 | 0 fixed pts | 0 cycles | 0 nodes | 0.99 avg steps | 1 max steps | 1.99 avg steps | 2 max steps | 0 final numbers |
| 3 | 234,136 | 0 fixed pts | 1 cycle | 2 nodes | 21.97 avg steps | 56 max steps | 23.97 avg steps | 58 max steps | 2 final numbers |
| 5 | 153,476,148 | 1 fixed pt | 1 cycle | 1 node | 23.93 avg steps | 46 max steps | 24.93 avg steps | 47 max steps | 1 final number |