Upper bounds for Stern's diatomic sequence and related sequences

From MaRDI portal



Abstract: Let (s2(n))n=0infty denote Stern's diatomic sequence. For ngeq2, 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,ngeq2, 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 displaystylelimsupnightarrowinftyfracsb(n)nlogbphi=frac(b2−1)logbphisqrt5.


Summary: Let \((s_2(n))_{n=0}^\infty\) denote Stern's diatomic sequence. For \(n\geqslant 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\geqslant 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 \(\limsup_{n\rightarrow\infty}\frac{s_{b}(n)}{n^{\log_{b}\phi}}=\frac{(b^{2}-1)^{\log_{b}\phi}}{\sqrt{5}}\).











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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q727176)