Programming Challenge

Let Fn denote the nth term of the fibonacci sequence F: 1,1,2,3,5,8...

Consider the following sequence G based on F: 1,3,5,16...

1. Determine an expression for the nth term of G in terms of F and n. Submit your answer as the url of WolframAlpha page that shows the required expression. (Hint F0 = 0)
2. Write a Ruby program that prints G up to a specified term n . Your program should read from stdin. The input will be the integer n. Put your answer in a pastie and submit the url.

Put both urls at the end of your email to jobs@gigmaven.com.