Hey, I'm not a programmer at all, but I'm hoping someone could help me

solve a problem. I've looked all over Google, Ruby forums, and C/C++

forums but havn't found my answer. I'm trying to generate all possible

permutations for 5 digits (1,2,3,4,5), up to and including 6 digits

long, in order from smallest to largest, broken into sets of numbers

with different lengths, including number repeats within the same number

(1112 for example), then filter out any numbers that don't include 1

anywhere. Wow thats a mouthful. Heres an example of what I mean.

1 digit long

1

2 digits long

11

12

13

14

15

21

31

41

51

and so on to 6 digits. Any help would be greatly appreciated! Thanks!