Timeline for Sum the First n Even Fibonacci Numbers
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 5, 2017 at 21:49 | history | edited | simon | CC BY-SA 3.0 | added 57 characters in body |
| Jan 5, 2017 at 21:30 | comment | added | BrainSteel | You can make this a tad shorter by shuffling things around a bit: a(n){return--n<1?0:4*a(n)+a(n-1)+2;} (36 bytes) | |
| Jan 5, 2017 at 13:39 | history | edited | simon | CC BY-SA 3.0 | added 138 characters in body |
| Jan 5, 2017 at 8:41 | history | edited | simon | CC BY-SA 3.0 | added 228 characters in body |
| Jan 4, 2017 at 22:26 | review | First posts | |||
| Jan 4, 2017 at 22:27 | |||||
| Jan 4, 2017 at 22:21 | history | answered | simon | CC BY-SA 3.0 |