input: def odd_collatz_sequence(n):
      """
      Given a positive integer n, return an ordered list containing the odd numbers in the Collatz sequence.
  
      The Collatz sequence is defined as follows: begin with a positive integer n. Each subsequent term is 
      determined from the preceding term as follows: if the preceding term is even, the next term is half 
      of the preceding term. If the preceding term is odd, the next term is 3 times the preceding term plus 1.
      The conjecture posits that no matter the starting value of n, the sequence will eventually reach 1.
  
      Note: 
          1. Collatz(1) is [1].
          2. The returned list should be in ascending order.
  
      For example:
      odd_collatz_sequence(5) returns [1, 5] # The Collatz sequence for 5 is [5, 16, 8, 4, 2, 1], so the odd numbers are only 1 and 5.
      """
output:     
      result = set()
      while n != 1:
          if n % 2 == 1:
              result.add(n)
          if n % 2 == 0:
              n = n // 2
          else:
              n = 3 * n + 1
      result.add(1)
      return sorted(result)
  