  We show that the number of short binary signed-digit representations of an
integer $n$ is equal to the $n$-th term in the Stern sequence. Various proofs
are provided, including direct, bijective, and generating function proofs. We
also show that this result can be derived from recent work of Monroe on binary
signed-digit representations of a fixed length.
