(In reply to
re: summing the series via computer by ken)
The first F I'm accounting for is F(3), as k=1 produces F(3).
Thereafter, the duplicated lines:
f1 = f2: f2 = f3: f3 = f1 + f2
f1 = f2: f2 = f3: f3 = f1 + f2
each advance by one F number, so together they advance to the next oddnumbered F.
So, yes, it counts only the oddnumbered Fibonaccis, and also excludes F(1).

Posted by Charlie
on 20160511 14:45:20 