ARTICLE
TITLE

Upper Bounds for Stern's Diatomic Sequence and Related Sequences

SUMMARY

Let (s2(n))8n=0(s_2(n))_{n=0}^\infty denote Stern's diatomic sequence. For n=2n\geq 2, we may view s2(n)s_2(n) as the number of partitions of n-1n-1 into powers of 22 with each part occurring at most twice. More generally, for integers b,n=2b,n\geq 2, let sb(n)s_b(n) denote the number of partitions of n-1n-1 into powers of bb with each part occurring at most bb times. Using this combinatorial interpretation of the sequences sb(n)s_b(n), we use the transfer-matrix method to develop a means of calculating sb(n)s_b(n) for certain values of nn. This then allows us to derive upper bounds for sb(n)s_b(n) for certain values of nn. In the special case b=2b=2, our bounds improve upon the current upper bounds for the Stern sequence. In addition, we are able to prove that lim sup\displaystyle{\limsup_{n\rightarrow\infty}\frac{s_b(n)}{n^{\log_b\phi}}=\frac{(b^2-1)^{\log_b\phi}}{\sqrt 5}}.

 Articles related

Lyuben Lichev, Dieter Mitsche    

In this paper we give new bounds on the bisection width of random 3-regular graphs on nn vertices. The main contribution is a new lower bound of 0.103295n0.103295n based on a first moment method together with a structural analysis of the graph, thereby i... see more


Dror Chawin, Ishay Haviv    

A graph GG is said to be kk-subspace choosable over a field FF if for every assignment of kk-dimensional subspaces of some finite-dimensional vector space over FF to the vertices of GG, it is possible to choose for each vertex a nonzero vector from its s... see more



Stoyan Dimitrov    

We study sorting by queues that can rearrange their content by applying permutations from a predefined set. These new sorting devices are called shuffle queues and we investigate those of them corresponding to sets of permutations defining some well-know... see more


Dhruv Rohatgi, John C. Urschel, Jake Wellens    

For a graph GG, let cp(G)cp(G) denote the minimum number of cliques of GG needed to cover the edges of GG exactly once. Similarly, let bpk(G)bp_k(G) denote the minimum number of bicliques (i.e. complete bipartite subgraphs of GG) needed to cover each edg... see more