title: Pythonic: Find all consecutive sub-sequences of certain length
body: <p>I have a list of integers and I want to find all consecutive sub-sequences of length n in this list. For example:</p>
  
  <pre><code>&gt;&gt;&gt; int_list = [1,4,6,7,8,9]
  &gt;&gt;&gt; conseq_sequences(int_list, length=3)
  [[6,7,8], [7,8,9]]
  </code></pre>
  
  <p>The best I could come up with is:</p>
  
  <pre><code>def conseq_sequences(self, li, length):
      return [li[n:n+length]
              for n in xrange(len(li)-length+1)
              if li[n:n+length] == range(li[n], li[n]+length)]
  </code></pre>
  
  <p>This isn't overly readable. Is there any readable pythonic way of doing this?</p>