  Stern's diatomic sequence is a well-studied and simply defined sequence with
many fascinating characteristics. The binary signed-digit representation of
integers is an alternative representation of integers with much use in
efficient computation, coding theory and cryptography. We link these two ideas
here, showing that the number of $i$-bit binary signed-digit representations of
an integer $n$ with $n<2^i$ is the $(2^i-n)^\text{th}$ element in Stern's
diatomic sequence. This correspondence makes the vast range of results known
for Stern's diatomic sequence available for consideration in the study of
binary signed-digit integers.
