Fibonacci Generator

Function: Fibonacci

This function generates a list of Fibonacci numbers using recursion.

Parameters

• n (required): An integer specifying the number of Fibonacci numbers to generate.

Return Type

• list of integers: A list containing the Fibonacci numbers.

Exceptions

• ValueError: Raised if the input parameter n is not a positive integer.

Code

let
    Fibonacci = (n as number) as list =>
        let
            result =
                if n = 1 then
                    {0}
                else if n = 2 then
                    {0, 1}
                else if n > 2 then
                    let
                        previous = Fibonacci(n-1),
                        second_previous = Fibonacci(n-2),
                        last_number = List.Last(previous) + List.Last(second_previous),
                        updated_result = previous & {last_number}
                    in
                        updated_result
                else
                    error "Input parameter 'n' must be a positive integer."
        in
            result
in
    Fibonacci

Usage Example

1. Call the Fibonacci function with the desired number of Fibonacci numbers to generate.
2. The function will return a list containing the Fibonacci numbers.

Code

let
    result = Fibonacci(10)
in
    result

Output

{0, 1, 1, 2, 3, 5, 8, 13, 21, 34}

In this example, the Fibonacci function is called with the parameter 10. The function generates a list containing the first 10 Fibonacci numbers and returns it as the output. The resulting list is {0, 1, 1, 2, 3, 5, 8, 13, 21, 34}.