Point-free look and say sequence You are too make a program that take an integer as the input and outputs the first what ever that number was of the look and say sequence.

For example:

$ ./LAS
8
[1,11,21,1211,111221,312211,13112221,1113213211]


The exact way you output the list is unimportant, as long as users can distinctly see the different numbers of the sequence. Here is the catch though. You can't use any sort of user-defined variable.

For example:


No variables, including scoped variables.
When you have functions, they can not have a name. (Exception, if your language requires a main function or similar to work, you may have that function.)
When you have functions, they can not have named arguments.


Also, you may not use a library with specific capabilities relating to the look and say sequence, and you can not access the network, or provide your program with any files (although it can generate and use its own.) This is code golf, so shortest code in characters wins!
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.