input: def odd_collatz_sequence(n):
      """
      Given a positive integer n, return a list of odd numbers found in the Collatz sequence, sorted in ascending order.
  
      The Collatz conjecture describes a sequence that starts with a positive integer n. Each subsequent term is generated 
      in such a way: if the term is even, the next term is half of it. If the term is odd, the next term is three times the 
      term plus one. The conjecture claims that the sequence eventually reaches 1, regardless of the starting number.
  
      Note: 
          1. Collatz(1) results in [1].
          2. The returned list must be sorted 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:     
      collatz_numbers = set()
      while n != 1:
          if n % 2 != 0:
              collatz_numbers.add(n)
          if n % 2 == 0:
              n = n // 2
          else:
              n = 3 * n + 1
      collatz_numbers.add(1)
      return sorted(collatz_numbers)
  