title: Scheme - Recursion : Sum consecutive elements of a list
body: <p>I'm trying to write a function using Scheme that :</p>
  
  <ol>
  <li>take a list of integers with more than two elements  as a parameter</li>
  <li>sum the n-th-element and (n+1)-th-element</li>
  <li>return this list</li>
  </ol>
  
  <p>Result should be as follows :</p>
  
  <pre><code>&gt; (SumNeighbors (list 1 2 3 4))
  (3 5 7)
  </code></pre>
  
  <p>I think I get the way to add elements but my recursion is totally wrong...</p>
  
  <pre><code>(define (SumNeighbors lst)
    (if (not (null? (cdr lst)))
        (append (list (+ (car lst) (car (cdr lst)))) (SumNeighbors (cdr lst)))))
  </code></pre>
  
  <p>Any help would be appreciated.</p>