How many increasing subsequences of length k can be made from an increasing sequence of length n.

For example, say you are given the sequence 1,2,3,4 and you want sequences of length 3, the sequences would be (1,2,3), (1,3,4), (2,3,4).

Is there a way I could compute the number of sequences like this.