0
I created a variation of Collatz's sequence that includes division by three. As far as I understand it is stable and works just like the original recursion. Additional tests are of course desirable.
$$f(n) = \begin{cases} (3n+1)/2 &;\text{if } n \equiv 1 \pmod{2}\\ n/2 &; \text{after previous if ...
