Upper bounds for Stern's diatomic sequence and related sequences
From MaRDI portal
(Redirected from Publication:727176)
Abstract: Let denote Stern's diatomic sequence. For , we may view as the number of partitions of into powers of with each part occurring at most twice. More generally, for integers , let denote the number of partitions of into powers of with each part occurring at most times. Using this combinatorial interpretation of the sequences , we use the transfer-matrix method to develop a means of calculating for certain values of . This then allows us to derive upper bounds for for certain values of . In the special case , our bounds improve upon the current upper bounds for the Stern sequence. In addition, we are able to prove that .
Recommendations
Cites work
Cited in
(13)- Polynomials whose coefficients are Stern numbers
- An extension of Stern's diatomic series
- Binary signed-digit integers and the Stern diatomic sequence
- The maximal order of hyper-(\(b\)-ary)-expansions
- Properties of multivariate \(b\)-ary Stern polynomials
- Three analogues of Stern's diatomic sequence
- Hyper $b$-ary expansions and Stern polynomials
- scientific article; zbMATH DE number 6868097 (Why is no real title available?)
- Record-setters in the Stern sequence
- Statistical distribution of the Stern sequence
- The Stern diatomic sequence via generalized Chebyshev polynomials
- The maximal order of Stern's diatomic sequence
- On the upper bound for the density of any injective vector
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)