input: def obtain_odd_collatz_numbers(n):
      """
      Given a positive integer n, produce a sorted list containing the odd numbers found in the Collatz sequence of n.
  
      The Collatz conjecture posits that starting with any positive integer n, the subsequent term is determined by: 
      if the preceding term is even, the next term is half of the preceding term; if odd, the next term is 3 times 
      the preceding term plus 1. The assertion is that the sequence will inevitably reach 1.
  
      Note: 
          1. Collatz(1) is [1].
          2. The returned list is sorted in ascending order.
  
      For example:
      obtain_odd_collatz_numbers(5) returns [1, 5] # The Collatz sequence for 5 is [5, 16, 8, 4, 2, 1], with 1 and 5 being the only odd numbers.
      """
output:     collatz = []
      while n != 1:
          if n % 2 == 1:
              collatz.append(n)
          if n % 2 == 0:
              n = n // 2
          else:
              n = 3 * n + 1
      collatz.append(1)
      return sorted(collatz)