---

Common Lisp
(defun fact (N)
  (cond ((<= N 1) 1) (t (* N (FACT (- N 1))))))

(defun sum (N)
  (cond ((<= N 0) 0) (t (+ N (SUM (- N 1))))))

(defun fib (N)
  (cond ((<= N 2) 1) (t (+ (fib (- N 1)) (fib (- N 2))))))

(defun nod (A B)
  (cond ((= B 0) A) (t (nod B (rem A B)))))

(defun fact_list (N)
(cond ((<= N 0) nil) (t (append(fact_list (- N 1)) (list (fact N))))))

(defun fib_list (N)
  (cond ((<= N 0) nil) (t (append (fib_list (- N 1)) (list (fib N))))))

(defun nod_list (A)
  (cond ((null (cdr A)) (car A)) (t (nod (car A) (nod_list (cdr A))))))