gistfile1.txt

public class FibonacciGenerator {
	
	public int getNumberAtPosition(int positionInSequence){
		if(positionInSequence > 1){
			return getNumberAtPosition(positionInSequence - 1) + 
					getNumberAtPosition(positionInSequence - 2);
		}
		return positionInSequence;
	}
	
	public int[] getSequenceOfLength(int length){
		if(length < 8 || length > 50){
			throw new IllegalArgumentException();
		}		
		int[] sequence = new int[length];
		for(int index = 0; index < length; index++){
			sequence[index] = getNumberAtPosition(index);
		}
		return sequence;
	}

}