Recursive Fibonacci Function in Clojure

Recursive Fibonacci Function in Clojure: a task in Terminal-Lego-15k (Harbor dataset). You are tasked with implementing a clean, purely recursive Fibonacci function in Clojure. The function should take only a single parameter n (the number of Fibonacci elements to return) and return a vector…

The task

You are tasked with implementing a clean, purely recursive Fibonacci function in Clojure. The function should take only a single parameter `n` (the number of Fibonacci elements to return) and return a vector containing the first `n` Fibonacci numbers.

Part of PrimeIntellect/Terminal-Lego-15k.