Upper bounds for Stern's diatomic sequence and related sequences

Abstract: Let

(s_{2} (n))_{n = 0}^{i} n f t y

denote Stern's diatomic sequence. For

n g e q 2

, we may view

s_{2} (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 g e q 2

, let

s_{b} (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

s_{b} (n)

, we use the transfer-matrix method to develop a means of calculating

s_{b} (n)

for certain values of

n

. This then allows us to derive upper bounds for

s_{b} (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

d i s p l a y s t y l e l i m s u p_{n i g h t a r r o w i n f t y} f r a c s_{b} (n) n^{l o g_{b} p h i} = f r a c (b^{2} - 1)^{l o g_{b} p h i} s q r t 5

.

Full work available at URL: https://arxiv.org/abs/1506.07824

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Cites Work

Cited In (11)

This page was built for publication: Upper bounds for Stern's diatomic sequence and related sequences