C# - Fibonacci-Folge berechnen

public int[] Fibonacci( int n )
{
    if( n==1 ) return new int[] {1};
    else if ( n==2 ) return new int[] {1,1};
    else
    {
        int[] fibonacci = new int[n];
        fibonacci[0] = 1;
        fibonacci[1] = 1;
        for( int i=2; i<n; i++ ) fibonacci[i] = fibonacci[i-2] + fibonacci[i-1];
        return fibonacci;
    }
}