Upper Bounds for Stern's Diatomic Sequence and Related Sequences
Combinatorics
2015-06-26 v1
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 .
Cite
@article{arxiv.1506.07824,
title = {Upper Bounds for Stern's Diatomic Sequence and Related Sequences},
author = {Colin Defant},
journal= {arXiv preprint arXiv:1506.07824},
year = {2015}
}
Comments
61 pages, 4 figures