Point-free look and say sequence
Haskell 206 Chars

import Data.List
import Control.Applicative
import Data.Function
main= readLn &gt;&gt;= print .(flip take (map read $ fix (("1":). map (concat .(map ((++)&lt;$&gt;(show . length)&lt;*&gt;((:[]). head))). group))::[Integer]))


It works by using the group function to group them into groups of equal things. Then it uses applicatives with functions to build a function that simultaneously reads the length, and appends it to with one the elements. It uses a fix and a map to create a recursive definition (point-free.) And there ya go.