For a given alphabet such as and a given length such as 5, a cyclic de Bruijn sequence like 10101110110001111100110100100000 contains the different length-5 words of that alphabet. This Demonstration uses primitive polynomials and shift register sequences to generate 150 distinct de Bruijn sequences. Each sequence is then repeatedly rotated by a multiplier to produce a pattern.