'''
Write a recursive function that generates the Fibonacci sequence up to a given 
number n and returns a list containing the Fibonacci numbers. The Fibonacci 
sequence is defined as:

F(0) = 0
F(1) = 1
F(n) = F(n-1) + F(n-2) for n > 1

Example output:

fibonacci_up_to(10)  # Returns [0, 1, 1, 2, 3, 5, 8]
'''

# Your code here