Upper Bounds for Stern's Diatomic Sequence and Related Sequences

Abstract

Let (s2(n))n=0∞ denote Stern's diatomic sequence. For n≥ 2, we may view s2(n) as the number of partitions of n-1 into powers of 2 with each part occurring at most twice. More generally, for integers b,n≥ 2, let sb(n) denote the number of partitions of n-1 into powers of b with each part occurring at most b times. Using this combinatorial interpretation of the sequences sb(n), we use the transfer-matrix method to develop a means of calculating sb(n) for certain values of n. This then allows us to derive upper bounds for sb(n) for certain values of n. In the special case b=2, our bounds improve upon the current upper bounds for the Stern sequence. In addition, we are able to prove that n→∞sb(n)nbφ=(b2-1)bφ 5.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…