Fibonacci problem

Question

How do I represent Fibonacci in a Arithmetic Sequence where Fibonacci 1 + Fibonacci 2 =8, or (1+2) + (2+3).

Answer 1

The Fibonacci sequence is NOT an arithmetic sequence (there's not a CONSTANT additive to go from one term to the next).

 

Usually, we define the Fibonacci Sequence by f(0) = 0, f(1) = 1, then f(n) = f(n-1) + f(n-2)  for n≥2.  (This is the so-called recursive definition.)

Answer 2

  

F(n) + F(n+1)=(n+n+1)+(n+1+n+2)=4n+ 4