A de Bruijn sequence B(k,n) is a cyclic sequence where every possible subsequence of length n over an alphabet of size k appears exactly once. For binary (k=2), length is 2^n. Generated by an Eulerian circuit in the de Bruijn graph — each node is an (n-1)-bit string, edges represent the n-bit extensions.