It's a very poorly worded question, but you have to assume they are asking for the nth Fibonnaci number where n is provided as the parameter.
In addition to all the techniques listed by others, for n > 1 you can also use the golden ratio method, which is quicker than any iterative method. But as the question says 'run through the Fibonacci sequence' this may not qualify. You'd probably also scare them to death.
