I have the following sequence: 0 2 3 5 8 13 21 34..........

This is very close to the fibonacci sequence, but not exactly. Any ideas?

Printable View

- April 1st 2013, 04:27 PMmikewienermFinding Formula for given sequence
I have the following sequence: 0 2 3 5 8 13 21 34..........

This is very close to the fibonacci sequence, but not exactly. Any ideas? - April 1st 2013, 07:01 PMGusbobRe: Finding Formula for given sequence
- April 2nd 2013, 05:38 AMmikewienermRe: Finding Formula for given sequence
This is a recursive formula. I was hoping someone could help me find a forumla where I can find F(n) without having to find the previous values. For example, finding F(50) would be very tedious.

- April 2nd 2013, 05:46 AMGusbobRe: Fibonacci Sequence Formula
After the first term, this sequence is

as the Fibonacci sequence (with the first three terms truncated). Surely you can use the same formula to calculate terms . I.e. if the fibonacci sequence is and your sequence here is , set__exactly the same__

for - April 2nd 2013, 06:08 AMHallsofIvyRe: Fibonacci Sequence Formula
What Gusbob said, of course!

But also you can apply the same ideas that lead to the "usual" Fibonacci formula. If you "look for" a solution of the form , the equation becomes . Dividing through by gives you or . Solving that . That is, for some constants A and B. That is exactly the solution you would get for the "usual" Fibonnacci formula. Putting and rather than setting them equal to the "usual" 1, 1, solve for A and b. - April 6th 2013, 04:10 AMisparksRe: Fibonacci Sequence Formula
Let G represent the Golden Ratio

Then Fn=(G^n+(G-1)^n))/Sqrt 5

Where ^ represents is to the power of

Another method is to use the Binomial Expansion by observing Pascal Triangle