Sure! Here’s a recursive function in Python that returns the first 10 Fibonacci numbers:

```python
def fibonacci(n):
    if n <= 0:
        return []
    elif n == 1:
        return [0]
    elif n == 2:
        return [0, 1]
    else:
        fib = fibonacci(n-1)
        fib.append(fib[-1] + fib[-2])
        return fib

print(fibonacci(10))
```

This function uses recursion to generate the Fibonacci sequence up to the `n`th number. The base cases are when `n` is less than or equal to 0, when n is 1, and when `n` is 2. For all other values of `n`, the function calls itself with `n-1` as the argument and appends the sum of the last two numbers in the returned list to generate the next number in the sequence.

Is there anything else you’d like to know?
spam fails_task lang_mismatch pii not_appropriate hate_speech sexual_content quality toxicity humor helpfulness creativity violence