input: from typing import List
  
  def generate_fibonacci(n: int) -> List[int]:
      """ Generate a list of Fibonacci numbers up to the nth term using a recursive approach.
      >>> generate_fibonacci(10)
      [1, 1, 2, 3, 5, 8, 13, 21, 34, 55]
      """
output:     if n <= 0:
          return []
      if n == 1:
          return [1]
      if n == 2:
          return [1, 1]
      
      fib_sequence = [1, 1]
      for i in range(2, n):
          next_fib = fib_sequence[-1] + fib_sequence[-2]
          fib_sequence.append(next_fib)
      
      return fib_sequence