> groupsOf n = takeWhile (not . null) . map (take n) . iterate (drop n) +1 for the name. Nice combinator-based definition too. (How does its performance compare to a directly recursive defn??) Regards, Malcolm