Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:
1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...
By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms.
This time I'm going to try to highlight the algorithm more. I.e., type out the algorithm next to the diagram and highlight which part is working.
Looks like the style for complex animations is (see this block). Chained transitions! Global variables to iterate over. Then:
- setTimeout(function () { ... })
- Some initial transition (e.g., empty annulus->annulus).
- At the end, call function.
- Recurse.
- Remove stuff too? another .each("end", function() {}) call?
Some resources: Project Euler Problem #2, and many examples from Mike Bostock.