attempted to limit the largest number that we would pass to the odd evaluation function (n = x * 3 + 1) only to discover after numerous bit shifing attempts that python seamlessly transitions from int to some form of bigInt after the max int value is exceeded.  That attempt at improvement was abandoned, only to discover now the process is hitting the recursive depth max for large numbers.  Will improve later.