code: public static int[] fibonacciSequence(final int n) {
      Assert.argument(n > 0, "The number of elements from the Fibonacci Sequence to calculate must be greater than equal to 0!");
  
      int[] fibonacciNumbers = new int[n];
  
      for (int position = 0; position < n; position++) {
        if (position == 0) {
          fibonacciNumbers[position] = 0;
        }
        else if (position < 2) {
          fibonacciNumbers[position] = 1;
        }
        else {
          fibonacciNumbers[position] = (fibonacciNumbers[position - 1] + fibonacciNumbers[position - 2]);
        }
      }
  
      return fibonacciNumbers;
    }
docs: Calculates the Fibonacci Sequence to the nth position.
  
  @param n an integer value indicating the position of the nth element in the Fibonacci Sequence.
  @return an integer array containing n elements of the Fibonacci Sequence.
  @throws IllegalArgumentException if the position (n) is less than 1.