A general recursion http://chaoxuprime.com/2011/12/implement-a-special-kind-of-recurrence-relation-as-a-infinite-list

rec.hs

import Data.List
rec :: Num a => [a] -> [a] -> [Int] -> [a]
rec c b m = a
  where a    = c++rest
        rest = next [] 0 m
        next xs k (m:ms)
          | k == m    = next (a:xs) k ms
          | otherwise = val ++ next (map tail xs) (k+1) (m:ms)
          where val = if (k<length c) then [] else [sum $ zipWith (*) (reverse (map head xs)) b]