
the net says a sequence.to tough to imagine!!!!!!!(for me)

Moderator: Board moderators
F = 3*F[i-1] - F[i-2];
Code: Select all
Case #1: 0
Case #2: 1
Case #3: 3
Case #4: 8
Case #5: 21
Case #6: 55
Case #7: 144
Case #8: 377
Case #9: 987
Case #10: 2584
Case #11: 6765
Case #12: 17711
Case #13: 46368
Case #14: 121393
Case #15: 317811
Case #16: 832040
Case #17: 2178309
Case #18: 5702887
Case #19: 14930352
Case #20: 39088169
Case #21: 102334155
Code: Select all
Case #1: 1
Case #2: 1
Case #3: 3
Case #4: 8
Case #5: 21
Case #6: 43
Case #7: 69
Case #8: 102
Case #9: 145
Case #10: 197
Case #11: 261
Case #12: 336
Case #13: 425
Case #14: 527
Case #15: 645
Case #16: 778
Case #17: 929
Case #18: 1097
Case #19: 1285
n........... fun(n)lovemagic wrote:while trying to formulate,i have got one,i dont know its right or wrong.fibonacci comes with every 2nd integer f the sequence.
for,
n=3 ans=1
n=4,ans=3
n=5,ans=8
n=6,ans=21
m i right here???
what's the ans for n=1 & n=2???
i think in both case the ans will be 1.
plz response...