2000 character limit reached
Non-standard binary representations and the Stern sequence (2308.07448v1)
Published 14 Aug 2023 in math.CO and math.NT
Abstract: 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.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.