0, 1, 2, 3, 4, 5, 6, 7, 8, 0, 1, 2, 3, 4, 5, 6, 7, 8, 0, 1, 2, 3, 4, 5, 6, 7, 8, 0, 1, 2, 3, 4, 5, 6, 7, 8, 0, 1, 2, 3, 4, 5, 6, 7, 8, 0,1, 2, 3, 4, 5, 6, 7, 8, 0, 1, 2, 3, 4, 5, 6, 7, 8, 0, 1, 2, 3, 4, 5, 6, 7, 8, 0, 1, 2, 3, 4, 5, 6, 7, 8, 0,….towards ∞ |

**Convert n to n mod 9****Locate corresponding node on graph (NB - 0 has been replaced with 9)****If n mod 9 is derived from an odd number follow broken edge to next state (lands on iterated state)****If n mod 9 is derived from an even number follow unbroken line to next state (lands on iterated state)****Ex. n =13 so 4 mod 9 (uneven). Follow broken edge back to 4 which now represents 4 mod 9 even (40)****13, 40, 20, 10, 5, 16, 8, 4, 2, 1****(4) (4) (2) (1) (5)(7)(8) (4)(2) (1)****ANY iterated sequence of n converted to n mod 9 will follow exact paths predetermined by graph**

| | |

| |