; 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.
(defn fib-seq [max]
  (if (= max 2)
  [1 2]
  (conj (fib-seq (dec max)) (reduce + (take-last 2 (fib-seq (dec max)))))))
;  (if (= max 2)
;    ('(1 2))
;    (do
;      (def prev-seq (fib-seq (dec max)))
;      (conj prev-seq (+ (take-last 2 prev-seq))))))
(print (fib-seq 10))

OyBFYWNoIG5ldyB0ZXJtIGluIHRoZSBGaWJvbmFjY2kgc2VxdWVuY2UgaXMgZ2VuZXJhdGVkIGJ5IGFkZGluZyB0aGUgcHJldmlvdXMKOyB0d28gdGVybXMuIEJ5IHN0YXJ0aW5nIHdpdGggMSBhbmQgMiwgdGhlIGZpcnN0IDEwIHRlcm1zIHdpbGwgYmU6CjsgMSwgMiwgMywgNSwgOCwgMTMsIDIxLCAzNCwgNTUsIDg5LCAuLi4uCjsgQnkgY29uc2lkZXJpbmcgdGhlIHRlcm1zIGluIHRoZSBGaWJvbmFjY2kgc2VxdWVuY2Ugd2hvc2UgdmFsdWVzIGRvIG5vdCBleGNlZWQKOyBmb3VyIG1pbGxpb24sIGZpbmQgdGhlIHN1bSBvZiB0aGUgZXZlbi12YWx1ZWQgdGVybXMuCihkZWZuIGZpYi1zZXEgW21heF0KICAoaWYgKD0gbWF4IDIpCiAgWzEgMl0KICAoY29uaiAoZmliLXNlcSAoZGVjIG1heCkpIChyZWR1Y2UgKyAodGFrZS1sYXN0IDIgKGZpYi1zZXEgKGRlYyBtYXgpKSkpKSkpCjsgIChpZiAoPSBtYXggMikKOyAgICAoJygxIDIpKQo7ICAgIChkbwo7ICAgICAgKGRlZiBwcmV2LXNlcSAoZmliLXNlcSAoZGVjIG1heCkpKQo7ICAgICAgKGNvbmogcHJldi1zZXEgKCsgKHRha2UtbGFzdCAyIHByZXYtc2VxKSkpKSkpCihwcmludCAoZmliLXNlcSAxMCkp