  The skew of a binary string is the difference between the number of zeroes
and the number of ones, while the length of the string is the sum of these two
numbers. We consider certain suffixes of the lexicographically-least de Bruijn
sequence at natural breakpoints of the binary string. We show that the skew and
length of these suffixes are enumerated by sequences generalizing the Fibonacci
and Lucas numbers, respectively.
