A de Bruijn sequence B(k,n) over alphabet size k is a cyclic sequence in which every possible substring of length n appears exactly once. Length = kⁿ. Equivalent to a Hamiltonian cycle on the de Bruijn graph. Used in DNA sequencing (universal library), combinatorics on words, and LFSR design.