#### Topic: Tandemnye repetitions

All greetings. There was a task. It is required to find an amount of lines of length n (n <= 100) which do not comprise repetitions of length from 1 to k (1 <= k <= 9) over the given alphabet from and letters (1 <= a <= 26). As tandemnym repetition is called the line of a type ww. I.e., to find all the line long which do not comprise type substrings ww, |w | <= k. There are ideas? Thanks.