Abstract
In this note we consider the sequence of rational numbers bn = ∑k=1n2k∕k. We show that the power of 2 in the expansion of bn is unusually large, at least n + 1 − log2(n + 1), and that this bound is best possible. The sequence bn, n = 1,2,3,…, is related to the sequence A0031449 in the On-Line Encyclopedia of Integer Sequences.
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
