One, multiplying by 3, then adding or subtracting 1 isn't the Fibonacci sequence. Two, I don't see the need for recursion here. What exactly is this function supposed to do? If it simply takes a number in the sequence and returns the next number in the sequence, there is no need for recursion. fibo(101) is supposed to return 304, right?

What list are you referring to? A list of all the numbers in the sequence which are less than or equal to 101?

1. the reason for me doing it recursively is because its an exercise in recursion.
2. after looking at the sequence of numbers i determined that 1 was the base case.
and if the position of the nth number was even it would multiply the previos number by 3 and subtract 1 if the position of the nth number was odd it would multiply by 3 and add 1.
the assignment was simply to create the method as i have done ( i believe).
in addition to this i wanted to write the program to see the function work....that im not sure how to do it.

the list im referring to is the list of numbers 1, 4 , 11, 34, 101.
I am simply tryin to create a recursive program to find the 6th integer in this list.

Thanks

Then I'd say you want to pass the function n , not nthfibo .
What kind of List are you going to use? It's a matter of personal preference, but I like Vector. You could make this your function:


If you're going to have a Vector, you'll need to pass fibo the Vector each recursive call, so you might as well have it be a void function. So if you passed it an empty Vector, the following call:


could result in numbers holding {1, 4, 11, 34, 101, 304}. Is that what you're looking for? I'd rename the function though.

So you do want the whole List, right, not just the 6th element?